HDU 5364

Distribution money

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

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

#include <stdio.h>
#include <string.h>


int a[1010];
int b[10010];

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int c,temp=0;
        int ans=0;
        memset(b,0,sizeof(b));
        for(int i=0;i<n;i++)
        {
            scanf("%d",&c);
            b[c]++;
            if(b[c]>temp)
            {
                temp=b[c];
                ans=c;
            }
        }
        if(temp>n-temp)
            printf("%d\n",ans);
        else
            printf("-1\n");

    }


    return 0;
}