1029 Ignatius and the Princess IV
2015-09-16 22:38
381 查看
Problem Description
"OK, you are not too bad, em... But you can never pass the next test." feng5166 says.
"I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says.
"But what is the characteristic of the special integer?" Ignatius asks.
"The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says.
Can you find the special integer for Ignatius?
Input
The input contains several test cases. Each test case contains two lines. The first line consists of an odd integer N(1<=N<=999999) which indicate the number of the integers feng5166 will tell our hero. The second line contains the N integers. The input is
terminated by the end of file.
Output
For each test case, you have to output only one line which contains the special number you have found.
Sample Input
Sample Output
Author
Ignatius.L
因为该整数出现过(N+1)/2,又因为总数N为奇数,
所以将这N个排序,中间那个数就是特殊的数。
"OK, you are not too bad, em... But you can never pass the next test." feng5166 says.
"I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says.
"But what is the characteristic of the special integer?" Ignatius asks.
"The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says.
Can you find the special integer for Ignatius?
Input
The input contains several test cases. Each test case contains two lines. The first line consists of an odd integer N(1<=N<=999999) which indicate the number of the integers feng5166 will tell our hero. The second line contains the N integers. The input is
terminated by the end of file.
Output
For each test case, you have to output only one line which contains the special number you have found.
Sample Input
5 1 3 2 3 3 11 1 1 1 1 1 5 5 5 5 5 5 7 1 1 1 1 1 1 1
Sample Output
3 5 1
Author
Ignatius.L
因为该整数出现过(N+1)/2,又因为总数N为奇数,
所以将这N个排序,中间那个数就是特殊的数。
#include<iostream> #include<algorithm> using namespace std; int a[1000000]; int main() { int i,N; while(cin>>N) { for(i=0;i<N;i++) { cin>>a[i]; } sort(a,a+N); cout<<a[(N-1)/2]<<endl; } }
相关文章推荐
- CodeForces-352A Jeff and Digits
- 如何清除linux的内存缓存,缓冲和交换空间
- ROS navigation相关概念小结
- R-CNN和SPP-net
- HDU 5439 Aggregated Counting (2015年长春赛区网络赛C题)
- 算法学习--二分法查找
- JavaScript原型链
- hive调用Linux的shell命令测试
- Linux kernel过滤网络数据包
- a^b-b^a - SGU 112(高精度快速幂)
- ASP.NET - TreeView控件,只操作最后一级节点
- 《转型之战:传统企业的互联网机会》转型案例+访谈。案例一般,分析总结水平一般,二星推荐。
- JVM系列文章(五):Javac编译与JIT编译
- 关于caffe安装中的一些小问题
- uva 11549 Calculator Conundrum 周期,哇!这也能过
- JSP九大对象:内置对象
- webService客户端传输xml中文乱码
- Android第九讲——网络(四) 文件的下载(单线程下载、多线程下载)
- 产品设计:Android应用-开发技术【数据缓存】
- JVM系列文章(四):类加载机制