import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

n,x,y = map(int,input().split())
cus = [list(map(str,input().split())) for i in range(n)]
all = [[0,0] for i in range(n)]
tot = 0 
for i in range(n):
    pi,ci = cus[i]
    pi = int(pi)
    tot += pi
    if ci == "A":
        all[i%(x+y)][0] += pi
    else:
        all[i%(x+y)][1] += pi
    
a = []
for i in range(min(x+y, n)):
    a.append(all[i][0] - all[i][1])

ans = 0
if n >= x+y:
    a.sort()
    for i in range(x):
        ans += a.pop()
    for i in range(y):
        ans -= a.pop()

else:
    aa = []
    bb = []
    for i in range(n):
        pi,ci = cus[i]
        if ci == "A":
            aa.append(int(pi))
        else:
            bb.append(int(pi))
    aa.sort()
    bb.sort()
    for i in range(min(len(aa), x)):
        ans += aa.pop()
    for i in range(min(len(bb), y)):
        ans += bb.pop()
    
    ans -= sum(aa)
    ans -= sum(bb)

    
        


print((ans+tot)//2)