26-63.cpp

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

int main() {
    fstream F;
    F.open("26-63.txt");

    int N, S;
    F >> N >> S;

    int p;
    char c;
    vector<int> q, z, q1;

    for (int i = 0; i < N; ++i) {
        F >> p >> c;
        if (c == 'Z') z.push_back(p);
        if (c == 'Q') q.push_back(p);
    }

    sort(z.rbegin(), z.rend());
    sort(q.rbegin(), q.rend());

    int kz = 0;

    while (!z.empty() && z.back() <= q.back()) {
        if (S < z.back()) break;
        ++kz;
        S -= z.back();
        z.pop_back();
    }

    while (!q.empty()) {
        if (S < q.back()) break;
        S -= q.back();
        q1.push_back(q.back());
        q.pop_back();
    }

    while (!q1.empty() && S + q1.back() >= z.back() && S > 0) {
        ++kz;
        S = S + q1.back() - z.back();
        q1.pop_back();
        z.pop_back();
    }

    cout << kz << "      " << S;
}