21898_ICPCScoreTotalizerSoftware

2022-5-16 18:20| 发布者: Hocassian| 查看: 29| 评论: 0|原作者: 肇庆学院ACM合集

摘要:
C:\Users\Administrator\Downloads\2019-10-12-10-14-4-89505941293000-Problem List-采集的数据-后羿采集器.html

Pro.ID

21898

Title

ICPC Score Totalizer Software

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=21898

AC

15

Submit

19

Ratio

78.95%

时间&空间限制

  • Time Limit: 0/0 MS (Java/Others)     Memory Limit: 0/0 K (Java/Others)
  • 描述

    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.

    输入

    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 integern, the number of judges participated in scoring the performance (3 ≤ n ≤ 100). Each of thenlines following it has an integral scores (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.

    输出

    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 integern, the number of judges participated in scoring the performance (3 ≤ n ≤ 100). Each of thenlines following it has an integral scores (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

    Hint

    请忽略本题。

    Source

    样例输入

    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

    样例输出

    342
    7
    300
    326

    提示

    请忽略本题。


    路过

    雷人

    握手

    鲜花

    鸡蛋

    最新评论

    返回顶部