#include <bits/stdc++.h>
// #include <atcoder/all>

using namespace std;
// using namespace atcoder;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<vi> vvi;
typedef vector<vll> vvll;

template <class T> using Vec = vector<T>;
template <class T> using Graph = Vec<Vec<T>>;

#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,n-1,-1)
#define rrepi(i,a,b) for(int i=int(a);i>int(b);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep)(__VA_ARGS__)

#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define REVERSE(x) reverse(all(x))

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

ll A[500000][2];

int main() {
  int N, X, Y;
  cin >> N >> X >> Y;

  int M = X+Y;

  rep(i, N) {
    int p;
    char c;
    cin >> p >> c;
    A[i%M][c-'A'] += p;
  }


  vector<pair<ll, int>> B;
  rep(i, M) B.push_back({A[i][0]-A[i][1], i});
  sort(all(B), greater<pair<ll, int>>());

  ll ans = 0;
  for (auto [_, i]: B) {
    if (X > 0) {
      ans += A[i][0];
      X--;
    } else {
      ans += A[i][1];
      Y--;
    }
  }

  cout << ans << endl;
}