#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<pair<int,string>> a;

pair<int,int> consistency(int n, int x, int y, int z){

    vector<int> xx;
    vector<int> yy;

    for(int i=0; i<n; i++){
        if(a[i].second == "USB") xx.push_back(a[i].first);
        else yy.push_back(a[i].first);
    }

    sort(begin(xx), end(xx));
    sort(begin(yy), end(yy));

    
    int m = xx.size();
    n = yy.size();

    int cost = 0;
    int ct = 0;
    
    int i = 0;
    while(i<min(x,m)){
        cost += xx[i];
        ct++;
        i++;
    }

    int j = 0;
    while(j<min(y,n)){
        cost += yy[j];
        ct++;
        j++;
    }

    int k = 0;
    while(i<m && j<n && k<z){
        if(xx[i] < yy[j]){
            cost += xx[i];
            i++;
        }
        else {
            cost += yy[j];
            j++;
        }
        k++;
    }

    while(i<m && k<z){
        cost += xx[i];
        i++;
        k++;
    }
    while(j<n && k<z){
        cost += yy[j];
        j++;
        k++;
    }
    ct += k;

    return {ct, cost};
}















pair<int,int> practice(int n, int x, int y, int z){


}





void solve() {
    
    int x, y, z;
    cin>> x >> y >> z;

    int n;
    cin >> n;
    
    a.resize(n);
    for(int i=0; i<n; i++){
        int x;
        string s;
        cin >> x >> s;
        a[i] = {x, s};
    }
    
    auto ans = consistency(n, x, y, z);

    cout << ans.first << " " << ans.second << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}