#include <bits/stdc++.h>
using namespace std;
int a1[300000], b1[300000];
void Qsort(long L, long R) {
  int i = 0, j = 0, x = 0;
  i = L;
  j = R;
  x = a1[L + rand() % (R - L + 1)];
  do {
    while (a1[i] < x) i++;
    while (a1[j] > x) j--;
    if (i <= j) {
      swap(a1[i], a1[j]);
      swap(b1[i], b1[j]);
      i++;
      j--;
    }
  } while (i <= j);
  if (i < R) Qsort(i, R);
  if (L < j) Qsort(L, j);
}
using namespace std;
int main() {
  long long a = 0, b = 0, c = 0, m = 0, i = 0, j = 0, sum = 0, h = 0;
  long l = 0;
  long k = 0;
  string s;
  cin >> a >> b >> c;
  for (i = 0; i < 300000; i++) {
    a1[i] = 0;
    b1[i] = 0;
  }
  cin >> m;
  for (i = 0; i < m; i++) {
    cin >> h >> s;
    if (s == "USB") {
      a1[k] = h;
      b1[k] = 1;
      k++;
    } else {
      a1[k] = h;
      b1[k] = 2;
      k++;
    }
  }
  h = 0;
  if (m != 0) Qsort(0, m - 1);
  i = 0;
  int n = m;
  while (a + b + c > 0 && i < n) {
    if (a > 0 && b1[i] == 1) {
      sum += a1[i];
      a--;
      h++;
    } else if (b > 0 && b1[i] == 2) {
      sum += a1[i];
      b--;
      h++;
    } else if (a == 0 && b1[i] == 1 && c > 0) {
      sum += a1[i];
      c--;
      h++;
    } else if (b == 0 && b1[i] == 2 && c > 0) {
      sum += a1[i];
      c--;
      h++;
    }
    i++;
  }
  cout << h << " " << sum;
  return 0;
}
