团体程序设计天梯赛 L2-015 互评成绩

#include<bits/stdc++.h>
using namespace std;
bool cmp(double a,double b){
	return a>b;
}
int main(){
	int n,k,m;
	cin>>n>>k>>m;
	double su=0;
	double max=0,min=100;
	vector<double>a;
	for(int i=0;i<n;i++){
		su=0;
		max=0;
		min=100;
		for(int j=0;j<k;j++){
			int x;
			cin>>x;
			if(x>max)
			max=x;
			if(x<min)
			min=x;
			su+=x;
		}
		double l=su-min-max;
		l=l*1.0/(k-2);
		a.push_back(l);
	}
	sort(a.begin(),a.end(),cmp);
	for(int i=m-1;i>=0;i--){
		if(i!=m-1)
		cout<<" ";
		printf("%.3lf",a[i]);
	}
	return 0;
}