#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using P = pair<ll,ll>;


int main()
{
	ll n,x,y;
	cin>>n>>x>>y;
	vector<vector<ll>> w(x+y,vector<ll>(2));
	for(ll i=0; i<n; i++) {
		ll p;
		char c;
		cin>>p>>c;
		w[i%(x+y)][c-'A'] += p;
	}

	sort(w.begin(), w.end(), [&](vector<ll>& x, vector<ll>&y){return x[0] - x[1] > y[0] - y[1];});
	ll ans = 0;
	for(ll i=0; i<x; i++) ans += w[i][0];
	for(ll j=x; j<x+y; j++) ans += w[j][1];
	cout << ans << endl;

}