简答题
偏难
#21996
T1社团招新
T1社团招新



答案与解析
正确答案:<pre class="brush:cpp;toolbar:false">#include <bits/stdc++.h>
using namespace std;
vector<int> a, b, c;
int main() {
int t;
cin >> t;
while(t--) {
//清空vector
a.clear();b.clear();c.clear();
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int x, y, z;
cin >> x >> y >> z;
if (x >= y && x >= z) {
ans += x;
a.push_back(x - max(y, z));
} else if (y >= x && y >= z) {
ans += y;
b.push_back(y - max(x, z));
} else {
ans += z;
c.push_back(z - max(x, y));
}
}
//判断
n /= 2;
if (a.size() <= n && b.size() <= n && c.size() <= n) {
cout << ans << endl;
} else {
if (a.size() > n) {
sort(a.begin(), a.end());
for (int i = 0; i < a.size()-n; i++) {
ans -= a[i];
}
} else if (b.size() > n) {
sort(b.begin(), b.end());
for (int i = 0; i < b.size()-n; i++) {
ans -= b[i];
}
} else {
sort(c.begin(), c.end());
for (int i = 0; i < c.size()-n; i++) {
ans -= c[i];
}
}
cout << ans << endl;
}
}
return 0;
}</pre>
这道题暂未补解析。