Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 3737 | Accepted: 2555 |
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.
<!-- end en only --><!-- begin en only -->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.
<!-- end en only --><!-- begin en only -->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.
<!-- end en only -->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.
<!-- end en only --><!-- begin en only -->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.
<!-- end en only --><!-- begin en only -->The end of the input is indicated by a line with a single zero in it.
<!-- end en only -->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
此题不用费力查找最大最小数的Index,只要记录下来数值,最终减掉就可以了。
import java.util.*; import java.text.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(true) { int num = cin.nextInt(); if(num == 0) break; int[] list = new int[num]; int max = 0; int min = 1000; int result = 0; int tmp = 0; for(int i = 0; i < num; i++) { tmp = cin.nextInt(); if(tmp > max) max = tmp; if(tmp < min) min = tmp; result += tmp; } result = (result - max - min)/(num-2); DecimalFormat df = new DecimalFormat("#"); System.out.println(df.format(result)); } } }
发表评论
-
POJ ACM习题【No.2328】
2009-07-05 19:43 895Guessing Game Time ... -
POJ ACM习题【No.3157】
2009-04-26 23:54 1633Java vs C++ Time Lim ... -
POJ ACM习题【No.2924】
2009-04-26 11:52 919Gauß in Elementary School ... -
POJ ACM习题【No.3176】
2009-04-26 10:53 1043Cow Bowling Time Lim ... -
POJ ACM习题【No.3173】
2009-04-25 23:30 900Parkside's Triangle ... -
POJ ACM习题【No.2845】
2009-04-25 22:25 120801000001 Time Limit: ... -
POJ ACM习题【No.2140】
2009-04-25 21:26 932Herd Sums Time Limit ... -
POJ ACM习题【No.1969】
2009-04-25 20:59 858Count on Canton Time ... -
POJ ACM习题【No.2840】
2009-04-25 19:24 1002Big Clock Time Limit ... -
POJ ACM习题【No.2521】
2009-04-24 22:41 846How much did the businessman l ... -
POJ ACM习题【No.1326】
2009-04-24 22:14 1008Mileage Bank Time Li ... -
POJ ACM习题【No.2756】
2009-04-24 20:28 770Autumn is a Genius T ... -
POJ ACM习题【No.3062】
2009-04-24 20:10 804Celebrity jeopardy ... -
POJ ACM习题【No.1547】
2009-04-23 20:03 770Clay Bully Time Limi ... -
POJ ACM习题【No.1552】
2009-04-23 19:39 747Doubles Time Limit: ... -
POJ ACM习题【No.1007】
2009-04-23 19:24 846DNA Sorting Time Lim ... -
POJ ACM习题【No.1565】
2009-04-22 22:40 839Skew Binary Time Lim ... -
POJ ACM习题【No.2403】
2009-04-22 22:18 857Hay Points Time Limi ... -
POJ ACM习题【No.1862】
2009-04-22 20:12 694Stripies Time Limit: ... -
POJ ACM习题【No.3224】
2009-04-22 19:57 740Lab杯 Time Limit: 1 ...
相关推荐
方便大家有针对性地联系 祝大家AC愉快~
pojACM题目分类,便于各类型同学分别做题有所参考
相信大家在做poj上的题目的时候如果没有分类的话很迷茫吧....这里有一份目前比较全面的poj题目分类..
02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ...
acm数据结构总结.doc acm数据结构总结.doc
poj acm题解,包括绝大部分poj题目的题解,可以供acm爱好者学习研究
本文件是ACM里的一些题目的源码、原题和习题的分析及详细解答。欢迎各位下载
http://acm.pku.edu.cn/JudgeOnline/ acm的AC解题报告
POJ ACM 1015 Jury Compromise 两种解法 解题报告
西工大C语言POJ习题答案.docx
PKU 、POJ ACM/ICPC300多题的代码,还有各种典型问题的分类代码
poj 2007 Scrambled Polygon.md
poj 3183 Stump Removal.md
poj 2430 Lazy Cows.md
poj 2900 Griddy Hobby.md
poj 3435 Sudoku Checker.md
poj 1984 Navigation Nightmare.md
poj 2174 Decoding Task.md
poj 2386 Lake Counting.md
poj 3585 Accumulation Degree.md