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
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
题意:多组测试样例,输入一个数N(N为奇数),然后下一行N个数,每组测试样例有一个特殊的数字,这个数字的特点是 appear at least (N+1)/2 times. ,输出你找到的那个特殊数字。
代码:
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stdlib.h.>
#include<cstring>
#include<stdio.h>
#include<cstdio>
using namespace std;
int a[1000000];
int main()
{
int n,i,t,re;
while(scanf("%ld",&n)!=EOF)
{
for(i=0;i<n;i++)
{
//scanf("%ld",&t);
cin>>t;
a[t]++;
if(a[t]>=(n+1)/2)
{
re=t;
}
}
printf("%ld\n",re);
}
}
感悟:一开始 想了好久怎么找那个特殊的数字呢,后来发现用数值存那个特殊的数字出现的次数。然后判断那个数组是否>=(n+1)/2 即可。