Hdu-2309-ICPC Score Totalizer Software

ICPC Score Totalizer Software

Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1477    Accepted Submission(s): 970

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

 

Recommend

teddy   |   We have carefully selected several similar problems for you:   2310  2311  2314  2312  2368 

农夫山泉,(ps.博主你就不能做点难题.....)水水更健康啦.

你看题目，说一大堆，其实有一半是废话.

主要还是看懂英文题目，全英文的题.我利用有道词典看了30分钟都没看懂......

题目的主要意思是:

输入一个数n,读入n个数,去掉最低的一个数和最高的一个数，再求平均值，输出.

在n不为0的情况下，重复这个操作！说了是农夫山泉......

import java.io.*;
import java.util.*;

public class Main
{

	public static void main(String[] args)
	{
		Scanner input = new Scanner(System.in);
		while (true)
		{
			int n;
			n = input.nextInt();
			if (n == 0)
			{
				break;
			}
			int a[] = new int[n];
			int sum = 0;
			for (int i = 0; i < n; i++)
			{
				a[i] = input.nextInt();
			}
			Arrays.sort(a);
			for (int i = 1; i < n - 1; i++)
			{
				sum += a[i];
			}
			sum /= (n - 2);
			System.out.println(sum);
		}
	}

}