题解（A85.采药）

#include<bits/stdc++.h>
using namespace std;
int p[10005];
int w[1005];
int dp[10005][3005];
int main(){
	int m,n;
	cin>>m>>n;
	for(int i = 1;i<=n;i++){
		cin>>w[i];
		cin>>p[i];
	}
	for(int i = 1;i<=n;i++){
		for(int j = 1;j<=m;j++){
			if(w[i]<=j) dp[i][j] = max(dp[i-1][j],dp[i-1][j-w[i]]+p[i]);
			else dp[i][j] = dp[i-1][j];
		}
	}
	cout<<dp[n][m];
	return 0;
}