L2-015 互评成绩 (25分)

L2-015 互评成绩 (25分)

用到了一些新函数，记录一下

#include<iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <functional>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <sstream>
#include <algorithm>
#define ll long long
#define PI acos(-1)
#define mes(x,y) memset(x,y,sizeof(x))
#define lp pair<ll, ll>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const ll inf = 5e9 + 30;
ll n, m, i, j, k, t, flag, x, y, z;
string s1, s2, s;
int main() {
	FAST_IO;
	while (cin >> n >> m >> k) {
		vector<double>v;
		for (i = 0; i < n; i++) {
			vector<double>nei; double grade;
			for (j = 0; j < m; j++) {
				cin >> grade;
				nei.push_back(grade);
			}
			nei.erase(max_element(nei.begin(), nei.end()));
			nei.erase(min_element(nei.begin(), nei.end()));
			v.push_back(accumulate(nei.begin(), nei.end(), 0)/(double(m-2)));
		}
		sort(v.begin(), v.end());
		for (i = n - k; i < n; i++) {
			if (i != n - k)cout << " ";
			cout << fixed << setprecision(3) << v[i];
		}
	}
}