题解

#include <bits/stdc++.h>
using namespace std;

// header
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vii;
typedef unsigned us;

#define INF 1e9
#define nl endl
#define faster ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, a, b) for (int i = int(a); i <= int(b); i++)
#define drep(i, a, b) for (int i = int(a); i > int(b); i--)
#define DREP(i, a, b) for (int i = int(a); i >= int(b); i--)

const int c3 = 1e3 + 2, c4 = 1e4 + 2, c5 = 1e5 + 2, c6 = 1e6 + 2;
// header-end

int main() {
faster;
vi mac, cold, steam;
int m, c, s, n, x, y, z, b_m, b_c, b_s;
b_m = b_c = b_s = 0;

cin >> n;
while (n--) {
	cin >> x >> y >> z;
	if (x) b_m++;
	if (y) b_c++;
	if (z) b_s++;

	if (x > 0) mac.push_back(x);
	if (y > 0) cold.push_back(y);
	if (z > 0) steam.push_back(z);
}
cin >> m >> c >> s;
b_m -= m;
b_c -= c;
b_s -= s;

long long sum = 0;
if (b_m > 0) {
	sort(mac.begin(), mac.end());
	rep (i, 0, b_m) {
		sum += mac[i];
	}
}

if (b_c > 0) {
	sort(cold.begin(), cold.end());
	rep (i, 0, b_c) {
		sum += cold[i];
	}
}

if (b_s > 0) {
	sort(steam.begin(), steam.end());
	rep (i, 0, b_s) {
		sum += steam[i];
	}
}
cout << sum;
return 0;

}