天梯赛 L2 互评成绩

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/ccDLlyy/article/details/79808035

题目链接：点击打开链接

思路：水题。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector<double> v,re;
int main(){
	int n,k,m;
	double score,sum;
	scanf("%d%d%d",&n,&k,&m);
	for(int i = 0;i < n;i++){
		v.clear();
		for(int j = 0;j < k;j++){
			scanf("%lf",&score);
			v.push_back(score);
		}
		sort(v.begin(),v.end());
		sum = 0.0;
		for(int i = 1;i < v.size() - 1;i++){
			sum += v[i];
		}
		sum /= (k - 2);
		re.push_back(sum);
	}
	sort(re.begin(),re.end());
	int start = re.size() - m,top = re.size() - 1;
	for(int i = start;i <= top;i++){
		printf("%.3f%c",re[i],i == top?'\n':' ');
	}
	return 0;
}