Ignatius and the Princess IV(map)
来源:互联网 发布:node.js javaweb 编辑:程序博客网 时间:2024/05/18 03:48
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 10398 Accepted Submission(s): 4102
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
Author
Ignatius.L
#include<iostream>#include<cstdio>#include<map>using namespace std;int main(){ map<int,int> m; map<int,int>::iterator ite; int n,t,p; while(~scanf("%d",&n)) { p=(1+n)/2; while(n--) { scanf("%d",&t); m[t]++; } for(ite=m.begin();ite!=m.end();ite++) { if(ite->second>=p) { printf("%d\n",ite->first); break; } } m.clear(); } return 0;}
- Ignatius and the Princess IV(map)
- hdu 1029 Ignatius and the Princess IV(水题,map)
- Ignatius and the Princess IV(暴力)
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- openCV实现卡通画的效果
- 软件应用无所不在 正吞噬整个世界
- hadoop 常出错问题
- 二进制
- java 学习笔记
- Ignatius and the Princess IV(map)
- oracle基础实例
- Flash Actionscript3殿堂之路
- Codeforces Beta Round #46 (Div. 2) E. Common ancestor
- 开发板自动启动的LED闪烁实验
- 删除tar包解压文件
- 判断两个数组中是否有相同的数字
- 字符集和编码
- 当你输入一个网址的时候,实际会发生什么?