Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdio>
- #include <cstring>
- #define max(x,y) ((x)>(y)?(x):(y))
- using namespace std;
- int pack[10001], wi[101], v[101], n, taget;
- int main()
- {
- scanf("%d", &n);
- memset(pack, 0, sizeof(pack));
- for(int i = 1; i <= n && scanf("%d %d", &wi[i], &v[i]); i++);
- scanf("%d", &taget);
- for(int i = 1; i <= n; i++)
- for(int j = taget; j >= wi[i]; j--)
- pack[j] = max(pack[j - wi[i]] + v[i], pack[j]);
- printf("%d\n", pack[taget]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment