BestCoder Round #50 (div.2) 1001

最新推荐文章于 2016-12-07 19:05:25 发布

原创最新推荐文章于 2016-12-07 19:05:25 发布 · 510 阅读

0 ·

CC 4.0 BY-SA版权

ACM 同时被 3 个专栏收录

42 篇文章

订阅专栏

hdu

24 篇文章

订阅专栏

水题

21 篇文章

订阅专栏

本文描述了一个关于金钱公平分配的问题，某人将其财富分成若干等份，并规定如果某人所获得的部分超过其他人总和，则此人将受到惩罚。通过输入参与者的ID及获取的份额数量，程序能够判断并输出是否有人违反此规则。

Problem Description

AFA want to distribution her money to somebody.She divide her money into n same parts.One who want to get the money can get more than one part.But if one man's money is more than the sum of all others'.He shoule be punished.Each one who get a part of money would write down his ID on that part.

Input

There are multiply cases.For each case,there is a single integer n(1<=n<=1000) in first line.In second line,there are n integer a1,a2...an(0<=ai<10000)ai is the the ith man's ID.

Output

Output ID of the man who should be punished.If nobody should be punished,output -1.

Sample Input

Sample Output

1
-1

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;

int a[10010];
int ha[10110];
int main()
{
    int n;
    while(cin>>n)
    {
        memset(ha,0,sizeof(ha));
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
            ha[a[i]]++;
        }
        int pos = -1;
        for(int i=0;i<n;i++)
        {
            if(ha[a[i]] > n/2)
            {
                pos = a[i];
                break;
            }
        }
        cout<<pos<<endl;
    }
    return 0;
}