#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ld = long double;
using ll = long long;

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

using P = pair<int,int>;

int main()
{
	int N, X, Y;
	cin >> N >> X >> Y;
	vector<pair<int,int>> A(N);
	rep(i,N)
	{
		cin >> A[i].first;
		char c;
		cin >> c;
		if(c=='A') A[i].second++;
	}

	int sz = min(X+Y,N);
	vector<vector<int>> B(sz, vector<int>(2));
	rep(i,N)
	{
		B[i%sz][A[i].second] += A[i].first;
	}
	vector<vector<int>> C(sz, vector<int>(2));
	rep(i,sz)
	{
		C[i][0] = B[i][1]-B[i][0];
		C[i][1] = i;
	}
	sort(C.begin(), C.end());
	reverse(C.begin(), C.end());
	ll ans = 0;
	rep(i,sz)
	{
		if(i<X) ans += B[C[i][1]][1];
		else ans += B[C[i][1]][0];
	}
	cout << ans << endl;
}