HDU 5364 Distribution money（水题）

Distribution money

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

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
  
  
  
  


  
  
  
  

   
   输入 n 表示有n份工资，n个数ai(0 <= ai <10000),表示ai这个人领了一份，问最后是否有人领的工资 大于 其他所有人的总和，有输出他的编号 ，否则输出-1。
  
  
  
  

   
   直接判断记录每个人领的次数为x，判断是否有 x > (n-x)即可
  
  
  
  

   
   
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <map>
#include <queue>
#define N 10001
#define inf 0x3f3f3f3f
using namespace std;
int a[N];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));
      for(int i=0;i<n;i++)
      {
          int x;
          scanf("%d",&x);
          a[x]++;
      }
      int ans=-1;
      for(int i=0;i<N;i++)
      {
          if(a[i]>(n-a[i]))
          {
              ans=i;
              break;
          }
      }
      printf("%d\n",ans);
    }
    return 0;
}