划分及格线

 1 #include<stdio.h>
 2 #include<stdlib.h>
 3 int part(int a[], int l, int r)
 4 {
 5     int m = a[r];
 6     int i,j;
 7     i = l;
 8     for (j=l; j < r; j++){
 9         if (a[j] < m)
10         {
11             int t = a[j];
12             a[j] = a[i];
13             a[i] = t;
14             i++;
15         }
16     }
17     a[r] = a[i];
18     a[i] = m;
19     return i;
20 }
21 
22 void quicksort(int a[], int l, int r)
23 {
24     if (l < r)
25     {
26         int q = part(a,l,r);
27         quicksort(a,l,q-1);
28         quicksort(a,q+1,r);
29     }
30 }
31 
32 int main()
33 {
34     int a[11],i;
35     for (i=1; i <= 10; i++)
36         //a[i] = rand()%100;
37         scanf("%d",&a[i]);
38     quicksort(a,1,10);
39     for (i=1; i <= 10; i++)
40         printf("%d ",a[i]);
41     printf("\n");
42     if (a[1] >= 60)
43         printf("%d\n",60);
44     else if(a[5] >= 10)
45         printf("%d\n",(a[5]/10)%10 * 10);
46     else
47         printf("%d\n",a[5]);
48 
49 }