@[ERROR007898](/user/756900) 这题是01背包问题，不能简单地排序做.
~~还有样例真的过了嘛~~
by jnyz2021109122116 @ 2022-12-01 07:24:04
@[jnyz2021109122116](/user/690687) 呃......蒟蒻没看算法标签......所以背包怎么做呢？
by When_can_I_be @ 2022-12-03 09:09:03
@[ERROR007898](/user/756900) sys这不就是个模板题吗，建议先去学习01背包
by Infinite_Progress @ 2022-12-08 08:15:06
@[ERROR007898](/user/756900)
###### 这是超简洁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:29:06