POJ 2388(排序)

 1 #include <stdio.h>
 2 #include <string.h>
 3 
 4 int arr[10005],ans,n;
 5 
 6 void inset(int x,int y)    //插入，并排序。
 7 {
 8     int i;
 9     for(i = y; arr[ i / 2 ] > x;i /= 2)
10         arr[ i ] = arr[ i / 2 ];
11     arr[ i ] = x;
12 }
13 
14 int deleteMin(int x )     //弹出顶点，相当于优先队列中的,先top(),然后pop();
15 {
16     int i, child;
17     int Min,last;
18     Min = arr[1],last = arr[ x ];
19     for(i = 1; i * 2 <= x; i = child )
20     {
21         child = i * 2;
22         if( child != x && arr[ child+1 ]
23                         < arr[ child ] )
24             child++;
25         if(last > arr[ child ])
26             arr[ i ] = arr[ child ];
27         else
28             break;
29     }
30 
31     arr[ i ] = last;
32     return Min;
33 }
34 int main()
35 {
36   //  freopen("in.txt","r",stdin);
37     int x,i;
38     scanf("%d",&n);
39     arr[0] = -10000000;
40     for(i=1;i<=n;i++)
41     {
42         scanf("%d",&x);
43         inset(x,i);
44     }
45     for(i=1;i<=n/2+1;i++)
46     {
47         ans = deleteMin(n-i+1);
48     }
49     printf("%d\n",ans);
50 }