111qqz的小窝

老年咸鱼冲锋!

hdu 5364 (bc#50 1001) Distribution money

Distribution money

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

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
 
水.
比赛的时候傻逼两发,妈蛋
没读完就break了….

 

 

说点什么

您将是第一位评论人!

提醒
wpDiscuz
粤ICP备18103363