L2-015 互评成绩 (25 分)

大水题

#include <iostream>
#include <algorithm>
#include <string>
#include <deque>
#include <cstring>
#include <queue>
#include <cstdio>
using namespace std;
int n, k, m;
int main(){
	cin>>n>>k>>m;
	int x;
	priority_queue<double, vector<double>, less<double>> pq;
	for(int i = 0; i < n; i++){
		int sum =0, Max = -0x3f3f3f3f, Min = 0x3f3f3f3f;
		for(int j = 0; j < k; j++){
			scanf("%d", &x);
			sum += x;
			if(x > Max) Max = x;
			if(x < Min) Min = x;
		}
		double t = (sum - Max - Min)/1.0/(k-2);
		pq.push(t);
	}
	vector<double> res;
	for(int i = 0; i < m; i++){
		res.push_back(pq.top());
		pq.pop();
	}
	reverse(res.begin(),res.end());
	for(int i = 0; i < res.size(); i++){
		if(i) printf(" ");
		printf("%.3f", res[i]);
	}
	return 0;
}