100pts WA求调

#include<bits/stdc++.h>
#define ll unsigned long long
using namespace std;
const ll N=1e4+10;
ll t,n,m,k,a[11][5],dp[6010];
void solve(){
	cin>>n>>m>>k;
	for(int i=1;i<=k;i++){
		cin>>a[i][1]>>a[i][2];
		a[i][1]/=1000;
	}t=n/1000;
	for(int i=1;i<=m;i++){
		for(int l=0;l<=t;l++){
			dp[l]=0;
		}
		for(int j=1;j<=k;j++){
			for(int l=a[j][1];l<=t;l++){
				dp[l]=max(dp[l-a[j][1]]+a[j][2],dp[l]);
			}
		}
		n+=dp[t];t=n/1000;
	}
	cout<<n;
	return;
}
int main(){
	solve();
	return 0;
}