50分求调o(╥﹏╥)o

#include<iostream>
#include<cstdio>
using namespace std;

int n,T;
int t[1013],v[1013],f[10013][10013];

int main(){
	cin>>T>>n;
	for (int i=1;i<=n;i++){
		cin>>t[i]>>v[i];
	}
	for (int i=1;i<=n;i++){
		for (int j=1;j<=T;j++){
			if (t[i]<=j) f[i][j]=max(f[i-1][j],f[i][j-t[i]]+v[i]);
			else f[i][j]=f[i-1][j];
		}
	}
	cout<<f[n][T];
	
	return 0;
}