Submission #2549728

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <functional>
#include<vector>
#include<math.h>
#include<bitset>
#include<string>
#include<queue>
using namespace std;

int main() {
	long long int N, w;
	cin >> N >> w;
	long long int valu[205][205];



	long long int V[205], W[205];

	for (int i = 0; i < 204; i++) {
		V[i] = 0;
		W[i] = 0;
	}


	for (int i = 1; i <=N; i++) {
		cin >> V[i] >> W[i];
	}

	
	for (int i = 0; i < 204; i++) {
		for (int k = 0; k < 204; k++) {
			valu[i][k] = 0;
		}
	}

	

	for (int i =1 ; i <= N; i++) {
		for (int k = 0; k <= w; k++) {
			if (k < W[i]) {
				valu[i][k] = valu[i - 1][k];
			}else{
				valu[i][k] = max(valu[i - 1][k], valu[i - 1][ k-W[i]]+V[i]);
			}
		}
	}
	cout << valu[N][w];
	return 0;
}

Submission Info

Judge Result