L2-015 互评成绩 (25 分)

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main(){
	int n, k, m;
	cin >> n >> k >> m;
	vector<vector<int>> a(n, vector<int>(k));
	for (int i = 0; i < n;++i){
		for (int j = 0; j < k;++j){
			cin >> a[i][j];
		}
		sort(a[i].begin(), a[i].end());
		for (int j = 2; j < k-1;++j){
			a[i][1] += a[i][j];
		}
	}
	vector<int> v;
	for (int i = 0; i < n;++i){
		v.push_back(a[i][1]);
	}
	sort(v.begin(), v.end(), greater<int>());
	k -= 2;
	printf("%.3f", 1.0 * v[m - 1] / k);
	for (int i = m - 2; i >= 0;--i)
		printf(" %.3f", 1.0 * v[i] / k);
}