B - Ignatius and the Princess IV

最新推荐文章于 2020-03-23 18:11:10 发布

辞树 LingTree

最新推荐文章于 2020-03-23 18:11:10 发布

阅读量251

点赞数

本文链接：https://blog.csdn.net/l18339702017/article/details/76820808

版权

本文介绍了一个算法挑战，任务是在一组由奇数个整数组成的数据集中找出出现次数超过或等于(N+1)/2次的特殊整数。文章提供了一段C++代码实现，通过使用映射表来记录每个整数出现的频率，进而找到符合条件的特殊整数。

摘要由CSDN通过智能技术生成

“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

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<map>
#include<algorithm>
using namespace std;
int a[999999];

int main()
{
    int n;
    map<int,int >mp;

    while(scanf("%d",&n)!=EOF)
    {
        int ans;
        mp.clear();
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            mp[a[i]]++;
            if(mp[a[i]]>=(n+1)/2)
            ans=a[i];
        }
        printf("%d\n",ans);
    }
    return 0;
}