给关注行不
by leoqing @ 2022-08-31 13:40:52
```cpp
#include <bits/stdc++.h>
using namespace std;
int ti[1005] , pri[1005] ;
int f[1005] ;
int main()
{
int t , m ;
cin >> t >> m ;
for(int i = 1 ; i <= m ; ++i)
cin >> ti[i] >> pri[i] ;
for(int i = 1 ; i <= m ; ++i)
for(int j = t ; j >= 1 ; --j)
if(j >= ti[i])
f[j] = max(f[j] , f[j - ti[i]] + pri[i]) ;
cout << f[t] ;
return 0 ;
}
```
by leoqing @ 2022-08-31 13:41:08
动态规划是吧
by wall_cow_wall_cinema @ 2022-09-04 10:16:20
@[ZZYTCCBS](/user/458102)
###### 这是超简洁C++代码
```cpp
#include<bits/stdc++.h>
using namespace std;
int f[1005] , c[1005] , w[1005] , n , v ;
int main()
{
cin >> v >> n ;
for(int i = 1 ; i <= n ; i ++ ) cin >> c[i] >> w[i] ;
for(int i = 1 ; i <= n ; i ++ ) for(int j = v ; j >= c[ i ] ; j -- ) f[j]=max(f[j],f[j-c[i]]+w[i]);
cout << f[v] ;
return 0;
}
```
by mzh98K @ 2022-12-27 18:30:37