Dotcpp  >  编程题库  >  [STL训练]Ignatius and the Princess IV
题目 2068:

[STL训练]Ignatius and the Princess IV

时间限制: 1Sec 内存限制: 128MB 提交: 263 解决: 130

题目描述

"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?

输入格式

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.

输出格式

For each test case, you have to output only one line which contains 
the special number you have found.

样例输入

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 

样例输出

3
5
1

提示

零基础的同学可以先学习基础,教程见:  C语言教程C++教程编译器教程数据结构教程Python教程单片机教程

视频教学见视频网课

标签

通过率

统 计

 提交 263
 正确 130
 格式错误 0
 答案错误 60
 时间超限 0
 内存超限 0
 输出超限 4
 运行错误 26
 编译错误 43