#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y;
} th[300005];
bool cmp(node a, node b) { return a.x < b.x; }
int main() {
  int a, b, c;
  int cnt = 0;
  scanf("%d%d%d", &a, &b, &c);
  int n;
  scanf("%d", &n);
  string str;
  int vl;
  for (int i = 1; i <= n; i++) {
    cin >> vl >> str;
    if (str[0] == 'U')
      th[++cnt].x = vl, th[cnt].y = 1;
    else
      th[++cnt].x = vl, th[cnt].y = 2;
  }
  sort(th + 1, th + 1 + cnt, cmp);
  int a1;
  long long a2;
  a1 = a2 = 0;
  for (int i = 1; i <= cnt; i++) {
    if (th[i].y == 1 && a > 0) {
      a--;
      a1++;
      a2 += th[i].x;
    } else if (th[i].y == 2 && b > 0) {
      b--;
      a1++;
      a2 += th[i].x;
    } else if (c > 0) {
      c--;
      a1++;
      a2 += th[i].x;
    }
    if (a == 0 && b == 0 && c == 0) break;
  }
  printf("%d %lld\n", a1, a2);
  return 0;
}
