采药日（背包dp)

# include <stdio.h>
# include <iostream>
# include <algorithm>
using namespace std;
int a[2000],b[2000];
int dp[2000][2000];
int main()
{
	 int T,M;
	 cin>>T>>M;
	 int i,j;
	 for(i=1;i<=M;i++)
	 {
	 	 cin>>a[i]>>b[i];
	 }
	 for(i=1;i<=M;i++)
	 {
	 	  for(j=T;j>=1;j--)
	 	  {
	 	  	    if(j>=a[i])
	 	  	    {
	 	  	    	  dp[i][j]=max(dp[i-1][j-a[i]]+b[i],dp[i-1][j]);
				   }
				   else
				   {
				   	  dp[i][j]=dp[i-1][j];
				   }
		   }
	 }
	 cout<<dp[M][T];
 }