代码:
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int m,n,w[50005],c[50005],dp[50005];
int main(){
cin>>m>>n;
for(int i=1;i<=n;i++){
cin>>c[i]>>w[i];
}
for(int i=1;i<=n;i++){
for(int j=w[i];j<=m;j++){
dp[j]=max(dp[j],dp[j-w[i]]+c[i]);
}
}
cout<<dp[m]<<endl;
return 0;
}