#include
using namespace std;
int f[3100000];
int main()
{
int i,j,n,flag,num,max;
double q,t[31];
double a[3],temp,sum;
char c,c1;
while(scanf("%lf%d",&q,&n),n)
{
i=1;
while(n--)
{ cin>>num;
sum=0;
flag=0;
for(j=0;j>c>>c1>>temp;
sum+=temp;
if(c!='A'&&c!='B'&&c!='C')
{ flag=1; continue; }
a[c-'A']+=temp;
if(sum>1000||a[c-'A']>600)
flag=1;
}
if(flag==0)
t[i++]=sum;
}
n=i-1;
max=(int)(q*100);
for(i=0;i= (int)(t * 100);j--)
if( f[j] = (int)(t * 100);j--)
if( f[j] < f[j - (int)(t * 100)] + (int)(t * 100))
f[j] = f[j - (int)(t * 100)] + (int)(t * 100);
(清楚一点 *^_^*)
|