Ignatius and the Princess IV

 1 #include<stdio.h>
 2 #include<string.h>
 3 
 4 int main()
 5 {
 6     int i,j;
 7     int N,num;
 8     int x,cas;
 9     while(scanf("%d",&N)!=EOF)
10     {
11         num=0;
12         for(i=1;i<=N;i++)
13         {
14             scanf("%d",&cas);
15             if(num==0)
16             {
17                 x=cas;
18                 num++;
19             }
20             else
21             {
22                 if(x==cas)
23                     num++;
24                 else
25                     num--;
26             }
27         }
28         printf("%d\n",x);
29     }
30     return 0;
31 }

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<algorithm>
 4 using namespace std;
 5 int a[1000005];
 6 int main()
 7 {
 8     int i,j,N;
 9 
10     while(scanf("%d",&N)!=EOF)
11     {
12         for(i=0;i<N;i++)
13             scanf("%d",&a[i]);
14         sort(a,a+N);
15         printf("%d\n",(a[(N-1+1)/2]));
16     }
17     return 0;
18 }