@Nameless One
5781 / 3430 / 255
Регистрация: 08.02.2010
Сообщений: 7,448
|
16.02.2012, 10:03
|
|
C | 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
| #include <stdio.h>
#include <stdlib.h>
int compare(const void* a, const void* b)
{
return (*(const double*) a) - (*(const double*) b);
}
int main(void)
{
size_t array_size;
size_t min_count;
size_t i;
double* array;
printf("Input the size of the array: ");
scanf("%u", &array_size);
array = malloc(sizeof(double) * array_size);
for(i = 0; i < array_size; ++i)
{
printf("%02u> ", i + 1);
scanf("%lf", &array[i]);
}
qsort(array, array_size, sizeof(double), compare);
printf("Input the number of min elements: ");
scanf("%u", &min_count);
if(min_count > array_size)
{
fprintf(stderr, "The number of min elements mustn't be"
" greater than %u; given %u\n", array_size, min_count);
exit(1);
}
for(i = 0; i < min_count; ++i)
printf("[%02u] -> %.3f\n", i + 1, array[i]);
free(array);
exit(0);
} |
|
0
|