HDUJ 1029 Ignatius and the Princess IV
来源:互联网 发布:惯性导航算法工程师 编辑:程序博客网 时间:2024/06/03 09:24
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 16747 Accepted Submission(s): 6725
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?
"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
51 3 2 3 3111 1 1 1 1 5 5 5 5 5 571 1 1 1 1 1 1
Sample Output
351
#include<iostream>#include<algorithm>using namespace std;int a[1000005];int main(){int n;while(cin>>n){int i;for(i=1;i<=n;i++)cin>>a[i];sort(a,a+n);cout<<a[(n+1)/2]<<endl;}return 0;}
0 0
- HDUJ 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- Ignatius and the Princess IV hdu 1029
- 【HDOJ】1029 -> Ignatius and the Princess IV
- hdoj 1029 Ignatius and the Princess IV
- HDOJ 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- 鸟哥的Linux私房菜01_主机规划与磁盘分区
- SQL 连接
- mysql操作语句
- IIS7.5 +Win7下如果查看asp网站的真实错误信息
- Greedy Gift Givers 贪婪的送礼者
- HDUJ 1029 Ignatius and the Princess IV
- JS中showModalDialog 详细使用
- Monkey命令可用的参数选项
- LeetCode-Copy List with Random Pointer
- 垂直滑动的viewpage+定时器。
- cocos2d-js:游戏进入后台和返回游戏的事件捕获和处理
- 低价购买
- 6、CRM2011编程实战——单点登录
- 浅谈IO调度算法