POJ 3325 ICPC Score Totalizer Software(我的水题之路——评委评分)
来源:互联网 发布:农村淘宝名片 编辑:程序博客网 时间:2024/06/08 01:54
Description
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
31000342052291193253001000020040083532424022742831324025230
Sample Output
3427300326
Source
#include <cstdio>#include <cstdlib>int main(void){ int max, min, tmp; int n, sum; int i, j; while (scanf("%d", &n), n!= 0){ min = 1001; max = -1; for (i = sum = 0; i < n; i++){ scanf("%d", &tmp); if (tmp < min){ min = tmp; } if (tmp > max){ max = tmp; } sum += tmp; } sum -= (max + min); printf("%d\n", sum / (n - 2)); } return 0;}
- POJ 3325 ICPC Score Totalizer Software(我的水题之路——评委评分)
- poj 3325 ICPC Score Totalizer Software
- poj 3325 ICPC Score Totalizer Software
- poj 3325 ICPC Score Totalizer Software
- POJ 3325 ICPC Score Totalizer Software G++
- POJ 3325 ICPC Score Totalizer Software(水题)
- POJ 3225 && HDU 2309 ICPC Score Totalizer Software(水~)
- POJ-3325-ICPC Score Totalizer Software-解题报告
- ICPC Score Totalizer Software
- ZOJ 3100 ICPC Score Totalizer Software(水~)
- HDU2309: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
- zoj 3100 ICPC Score Totalizer Software
- zoj 3100 ICPC Score Totalizer Software
- HDU 2309 ICPC Score Totalizer Software
- Java获取当前时间
- MYSQL 的备份和恢复
- Android日记之2012/02/14——浅谈设计模式Simple Factory
- Eclipse安装ivyDe插件
- MYSQL在ubuntu安装出错
- POJ 3325 ICPC Score Totalizer Software(我的水题之路——评委评分)
- 原来google主页也有bug
- MYSQL主、从服务器配置及错误处理
- 关于Hibernate修改数据库主键
- MySQL技巧:结合相关参数 做好Limit优化
- eclipse 高频快捷键使用
- 平面中判断点是否在某一三角形内算法 .
- 创建立方体
- Cv模式识别