HDU2309 ICPC Score Totalizer Software【水题】
来源:互联网 发布:xp如何查找网络打印机 编辑:程序博客网 时间:2024/06/01 07:23
ICPC Score Totalizer Software
Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1499 Accepted Submission(s): 987
Problem Description
The International Clown and Pierrot Competition (ICPC), is one of the most distinguished and also the most popular events on earth in the show business.
One of the unique features of this contest is the great number of judges that sometimes counts up to one hundred. The number of judges may differ from one contestant to another, because judges with any relationship whatsoever with a specific contestant are temporarily excluded for scoring his/her performance.
Basically, scores given to a contestant's performance by the judges are averaged to decide his/her score. To avoid letting judges with eccentric viewpoints too much influence the score, the highest and the lowest scores are set aside in this calculation. If the same highest score is marked by two or more judges, only one of them is ignored. The same is with the lowest score. The average, which may contain fractions, are truncated down to obtain final score as an integer.
You are asked to write a program that computes the scores of performances, given the scores of all the judges, to speed up the event to be suited for a TV program.
Input
The input consists of a number of datasets, each corresponding to a contestant's performance. There are no more than 20 datasets in the input.
A dataset begins with a line with an integer n, the number of judges participated in scoring the performance (3 ≤ n ≤ 100). Each of the n lines following it has an integral score s (0 ≤ s ≤ 1000) marked by a judge. No other characters except for digits to express these numbers are in the input. Judges' names are kept secret.
The end of the input is indicated by a line with a single zero in it.
Output
For each dataset, a line containing a single decimal integer indicating the score for the corresponding performance should be output. No other characters should be on the output line.
Sample Input
3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
Sample Output
342
7
300
326
Source
Japan 2007 Domestic
题目大意:N个裁判打分,去掉一个最高分和最低分,求最终的平均分。
思路:先存入数组A[]中,然后排序好后,去掉第一个和最后一个。最后计算平均分。
#include<iostream>#include<algorithm>using namespace std;int A[110];int main(){ int N; while(cin >> N && N) { for(int i = 0; i < N; ++i) cin >> A[i]; sort(A,A+N); int aver = 0; for(int i = 1; i < N-1; ++i) aver += A[i]; cout << aver/(N-2) << endl; } return 0;}
0 0
- HDU2309 ICPC Score Totalizer Software【水题】
- HDU2309:ICPC Score Totalizer Software
- ICPC Score Totalizer Software
- HDOH 2309 ICPC Score Totalizer Software(水题)
- zoj_3100 ICPC Score Totalizer Software
- POJ3325----ICPC Score Totalizer Software
- ICPC Score Totalizer Software 2309
- zoj3100 ICPC Score Totalizer Software
- POJ 3325 ICPC Score Totalizer Software(水题)
- zoj 3100 ICPC Score Totalizer Software
- zoj 3100 ICPC Score Totalizer Software
- poj 3325 ICPC Score Totalizer Software
- HDU 2309 ICPC Score Totalizer Software
- poj 3325 ICPC Score Totalizer Software
- JAVA hdu 2309 ICPC Score Totalizer Software
- hdu 2309 ICPC Score Totalizer Software
- poj 3325 ICPC Score Totalizer Software
- Hdu-2309-ICPC Score Totalizer Software
- UVA Foreign Exchange(排序)
- gdb如何调试没有符号表(未加-g选项的编译)的程序
- poj 2612 Mine Sweeper
- 从手机丢失看数据安全
- Dungeon Game
- HDU2309 ICPC Score Totalizer Software【水题】
- JSON的parse()和stringfy()方法
- oracle 中 dual 详解
- event.keyCode ,event.which ,event.charCode 键盘事件
- Hive Parquet配置
- android通讯录:拨打电话和发短信
- Android 打造炫目的圆形菜单 秒秒钟高仿建行圆形菜单
- init进程简析
- poj 2361 Tic Tac Toe