1102 采药

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<algorithm>
 4 
 5 using namespace std;
 6 
 7 const int N = 110 ;
 8 
 9 int f[N][1010];
10 int ti[N];
11 int ji[N];
12 int t,m,n;
13 
14 int main()
15 {
16     scanf("%d%d",&t,&m);
17     for(int i = 1;i <= m; ++i)
18         scanf("%d%d",&ti[i],&ji[i]);
19     for(int i = 1;i <= m; ++i)
20     {
21         for(int j = 0 ;j <= t; ++j)
22         {
23             if(j>=ti[i]) f[i][j] = max(f[i-1][j] , f[i-1][j-ti[i]] + ji[i]);
24             else f[i][j] = f[i-1][j] ;
25         }
26     }
27     printf("%d",f[m][t]);
28     return 0;
29 }