直接抄吧

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
int n;
cin >> n;

vector<int> mac, cold, steam;
int b_m = 0, b_c = 0, b_s = 0;

for (int i = 0; i < n; i++) 
{
    int x, y, z;
    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);
}

int m, c, s;
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());
    for (int i = 0; i < b_m; i++) 
    {
        sum += mac[i];
    }
}

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

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

cout << sum;

return 0;

}