Ignatius and the Princess IV（map）

最新推荐文章于 2025-05-27 14:00:55 发布

原创最新推荐文章于 2025-05-27 14:00:55 发布 · 263 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#Ignatius and the Princess IV（map） #c++

简单算法题专栏收录该内容

42 篇文章

订阅专栏

博客围绕一个算法问题展开，给定一个奇数N和N个整数，其中有一个特殊整数会至少出现(N+1)/2次。需找出该特殊整数。输入包含多组测试用例，每组两行，第一行是奇数N，第二行是N个整数。作者使用map解决该问题并通过测试。

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
分析：这里我用的是map

#include<cstdio>
#include<cmath>
#include <iostream>
#include<algorithm>
#include <map>
#define N 1000000
int a[N];
using namespace std;
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF){
		int max=0;
		map<int,int>mp;
		for(int i=0;i<n;i++)
		{
			cin>>a[i];
			mp[a[i]]++;
		}
		map<int,int>::iterator it;
		for(it=mp.begin();it!=mp.end();it++)
		{
			if((it->second)>=max)
			max=it->second;
		}
		for(it=mp.begin();it!=mp.end();it++)
		if(it->second==max)
		cout<<it->first<<endl;
		
	}
	return 0;
}

通过！