1846C - Rudolf and the Another Competition
My Code
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, m, t;
cin >> n >> m >> t;
vector<vector<int>> a(n, vector<int>(m));
vector<tuple<int, ll, int>> tp;
for (int i = 0; i < n; i++) {
for (int k = 0; k < m; k++) {
cin >> a[i][k];
}
sort(a[i].begin(), a[i].end());
int cnt = 0;
int sum = 0;
ll pen = 0;
for (int k = 0; k < m; k++) {
if (sum + a[i][k] <= t) {
sum += a[i][k];
pen += sum;
cnt += 1;
} else {
break;
}
}
tp.emplace_back(cnt, pen, i);
}
sort(tp.begin(), tp.end(), [&](tuple<int, ll, int> a, tuple<int, ll, int> b) {
if (get<0>(a) == get<0>(b)) {
return get<1>(a) < get<1>(b);
}
return get<0>(a) > get<0>(b);
});
int ans = 0;
for (int i = 0; i < n; i++) {
if (get<2>(tp[i]) == 0) {
ans = i + 1;
break;
}
}
cout << ans << "\n";
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0);
int t = 1;
cin >> t;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
}