POJ 2833 解题报告

/*
ID: thestor1
LANG: C++
TASK: poj2833
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>          // std::priority_queue
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

int main()
{
int n1, n2, n;
priority_queue<int, std::vector<int>, std::greater<int> > greatest;
priority_queue<int> least;
double sum;
int num, gsum, lsum;
while (scanf("%d%d%d", &n1, &n2, &n) > 0 && n)
{
sum = 0;
for (int i = 0; i < n; ++i)
{
scanf("%d", &num);
sum += num;
if (greatest.size() < n1)
{
greatest.push(num);
}
else if (num < greatest.top())

if (greatest.size() > n1)
{
greatest.pop();
}
least.push(num);
if (least.size() > n2)
{
least.pop();
}
}

n -= greatest.size() + least.size();

gsum = 0;
while (!greatest.empty())
{
gsum += greatest.top();
greatest.pop();
}

lsum = 0;
while (!least.empty())
{
lsum += least.top();
least.pop();
}

printf("%.6lf\n", (sum - gsum - lsum) / n);
}
return 0;
}