poj 3325 ICPC Score Totalizer Software

ICPC Score Totalizer Software

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 5955		Accepted: 4130

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

#include<iostream>
using namespace std;
int main()
{
int n;
int i;
int sum;
int ave;
int max,min;
int input[100]={0};
while(1)
    {
        cin>>n;
if(n==0)
break;
        sum=0;
        ave=0;
for(i=0;i<n;i++)
            cin>>input[i];
        max=input[0];
        min=input[0];
for(i=0;i<n;i++)
        {
if(input[i]>max)
                max=input[i];
if(input[i]<min)
                min=input[i];
            sum+=input[i];
        }
        ave=(sum-max-min)/(n-2);
        cout<<ave<<endl;
    }
return 0;    
}

转载于:https://www.cnblogs.com/w0w0/archive/2011/11/23/2259807.html