버림 없이 평균 비교하기

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int trim(vector<int> row) {
    sort(row.begin(), row.end());
    int sum = 0;
    for (int i = 1; i + 1 < (int)row.size(); ++i) sum += row[i];
    return sum;
}
int solution(vector<vector<int>> scores) {
    int best = 0, bestSum = trim(scores[0]), bestCount = (int)scores[0].size() - 2;
    for (int i = 1; i < (int)scores.size(); ++i) {
        int sum = trim(scores[i]), count = (int)scores[i].size() - 2;
        if (sum / count > bestSum / bestCount) {
            best = i; bestSum = sum; bestCount = count;
        }
    }
    return best + 1;
}
int main() {
    int n; cin >> n;
    vector<vector<int>> scores(n);
    for (int i = 0; i < n; ++i) {
        int m; cin >> m; scores[i].resize(m);
        for (int j = 0; j < m; ++j) cin >> scores[i][j];
    }
    cout << solution(scores) << '\n';
}