HDU 5364 Distribution money 模拟

Distribution money

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 213    Accepted Submission(s): 121

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

  
  

   
   3
1 1 2
4
2 1 4 3
  
  

 

Sample Output

  
  

   
   1
-1
  
  

 

Source

BestCoder Round #50 (div.2)

 

设置一个数组，每一个元素代表一个人，输入数据的时候，出现谁就把它的数值加1，最后枚举每一个元素，看它的数值是否大于其它所有元素数值的总和。

#include <iostream>
#include <memory.h>
using namespace std;

int people[10010];
int punish[10010];
int n,id,num;

int main()
{
    int i;
    int flag;
    while(cin>>n)
    {
        memset(people,0,sizeof(people));
        flag=0;
        num=0;
        for(i=0;i<n;i++)
        {
            cin>>id;
            people[id]++;
        }
        for(i=1;i<10010;i++)
        {
            if(people[i]!=0)
            {
                if(people[i]>(n-people[i]))
                {
                    punish[num++]=i;
                    flag=1;
                }
            }
        }
        if(flag==1)
        {
            for(i=0;i<num-1;i++)
                cout<<punish[i]<<' ';
            cout<<punish[i]<<endl;
        }
        else
            cout<<-1<<endl;
    }
    return 0;
}