CodeForce-762B USB vs. PS/2(贪心)

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

#define LL long long
int a,b,c;
int m;
LL x1[300009],x2[300009];

int main()
{
    while(~scanf("%d %d %d",&a,&b,&c))
    {//读取数据过多,cin超时
        int sum1=0,sum2=0;
        memset(x1,0,sizeof x1);
        memset(x2,0,sizeof x2);
        LL q,ans=0;
        string p;
        scanf("%d",&m);
        while(m--)
        {
            cin>>q>>p;
            if(p=="USB") x1[sum1++]=q;
            else x2[sum2++]=q;
        }
        sort(x1,x1+sum1);
        sort(x2,x2+sum2);
        int aa=min(a,sum1),bb=min(b,sum2),sum=aa+bb,k=0;
        while(k<c)
        {
            if(aa<sum1&&bb<sum2&&x1[aa]<x2[bb]) aa++;
            else if(aa<sum1&&bb<sum2) bb++;
            else if(aa<sum1) aa++;
            else if(bb<sum2) bb++;
            else break;
            sum++;
            k++;
        }
        for(int i=0;i<aa;i++)
            ans+=x1[i];
        for(int i=0;i<bb;i++)
            ans+=x2[i];
        printf("%d %lld\n",sum,ans);
    }
    return 0;
}