백준 소스코드 [C++] 12865 평범한 배낭

www.acmicpc.net/problem/12865

12865번: 평범한 배낭

백준 소스코드 [C++] 12865 평범한 배낭

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
typedef long long ll;
using namespace std;
int bag[100001];
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, m, value, weight;
	cin >> n >> m;
	for (int i = 1;i <= n;i++){
		cin >> weight >> value;
		for (int j = m;weight<=j;j--)
				bag[j] = max(bag[j], bag[j - weight] + value);
	}
	cout << bag[m];
	return 0;
}