程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> 更多編程語言 >> 編程解疑 >> each-The Average

each-The Average

編輯:編程解疑
The Average

Description

In a speech contest, when a contestant finishes his speech, the judges will then grade his performance. The staff remove the highest grade and the lowest grade and compute the average of the rest as the contestant’s final grade. This is an easy problem because usually there are only several judges.

Let’s consider a generalized form of the problem above. Given n positive integers, remove the greatest n1 ones and the least n2 ones, and compute the average of the rest.

Input

The input consists of several test cases. Each test case consists two lines. The first line contains three integers n1, n2 and n (1 ≤ n1, n2 ≤ 10, n1 + n2 < n ≤ 5,000,000) separate by a single space. The second line contains n positive integers ai (1 ≤ ai ≤ 108 for all i s.t. 1 ≤ i ≤ n) separated by a single space. The last test case is followed by three zeroes.

Output

For each test case, output the average rounded to six digits after decimal point in a separate line.

Sample Input

1 2 5
1 2 3 4 5
4 2 10
2121187 902 485 531 843 582 652 926 220 155
0 0 0
Sample Output

3.500000
562.500000

最佳回答:


#include
#include
#include
using namespace std;
priority_queue , less > qmax;
priority_queue , greater > qmin;
int main()
{
int num,i,minus;
long long sum;
int n,m,k;
int minsize,maxsize;
while (scanf("%d%d%d",&m,&n,&k),m || n || k)
{
minsize = maxsize = 0;
sum = 0;
for (i = 0; i < k; i ++)
{
scanf("%d",&num);
sum += (long long)num;
if (minsize < m)
{
qmin.push(num);
minsize ++;
}
else
{
if (num > qmin.top())
{
qmin.pop();
qmin.push(num);
}
}
if (maxsize < n)
{
qmax.push(num);
maxsize ++;
}
else
{
if (num < qmax.top())
{
qmax.pop();
qmax.push(num);
}
}
}
minus = 0;
while (!qmax.empty())
{
minus += qmax.top();
qmax.pop();
}
while (!qmin.empty())
{
minus += qmin.top();
qmin.pop();
}
printf("%f\n",(1.0 * sum - (long long)minus) / (1.0 * (k - m - n)));
}
return 0;
}

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved