60分，2,5点wa，求救！！！

#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include <math.h>
#define ll long long
#define Ull unsigned long long
using namespace std;
const int Inf=100+1;
ll V=21;
ll m,n; 
map<string,ll>ma;
ll a[Inf],b[Inf],c[Inf];
ll z=0;
ll f[Inf];
ll ans=0; 
int main(){
	cin>>m>>n;
	V-=m;
	for(ll i=1;i<=n;i++){
		ll a1,a2,a3;
		string a4;
		cin>>a1>>a2>>a3>>a4;
		if(ma[a4]==0)ma[a4]=++z;
		a[ma[a4]]+=a1;
		b[ma[a4]]=a2;
		c[ma[a4]]=a3;
	}
	for(ll i=1;i<=z;i++){//枚举物品 
		for(ll k=1;k<=(a[i]/c[i])+1;k++){//枚举占格数 
			ll C=min(a[i],k*c[i]);//数目 
			ll B=C*b[i];//对应价值 
			for(ll j=V;j>=k;j--){
				f[j]=max(f[j],f[j-k]+B);
			}
		}
	}
	for(ll i=1;i<=V;i++){
		ans=max(ans,f[i]);
	}
	printf("%lld",ans);
	return 0;
}