0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-05 10:38:54 +00:00
OI-codes/ybt/1268/1268.cpp

29 lines
515 B
C++

#include <iostream>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 1005;
int m, n, w[N], c[N], f[N][N];
int main() {
std::ios::sync_with_stdio(false);
cin >> m >> n;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> c[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= m; j++) {
f[i][j] = std::max(f[i - 1][j], j >= w[i] ? f[i][j - w[i]] + c[i] : f[i - 1][j]);
}
}
cout << "max=" << f[n][m] << endl;
return 0;
}