Submission #1679902

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
//---------------------------------------------------
//ライブラリゾーン！！！！
//#define int long long
#define str string
#define rep(i,j) for(int i=0;i<(int)(j);i++)
typedef long long ll;
typedef long double ld;
const ll inf = 4523372036854775807;
short gh[2][4] = { { 0,0,-1,1 },{ -1,1,0,0 } };
struct P {
	ll pos, cost;
};
bool operator<(P a, P b) { return a.cost < b.cost; }
bool operator>(P a, P b) { return a.cost > b.cost; }
struct B {//隣接リスト表現
	ll to, cost;
};
struct S {//辺の情報を入れる変数
	int from, to, cost;
};
struct H {
	int x, y;
};
bool operator<(H a, H b) {
	if (a.x != b.x) return a.x < b.x;
	return a.y < b.y;
}
ll gcm(ll i, ll j) {//最大公約数
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcm(j%i, i);
}
ld rad(ld a, ld b, ld c, ld d) {
	return sqrt(pow(a - c, 2) + pow(b - d, 2));
}//rad＝座標上の2点間の距離
int ari(int a, int b, int c) {
	return (a + b)*c / 2;
}//等差数列の和
bool suf(ld a, ld b, ld c, ld d) {
	if (b <= c || d <= a) return 0;
	return 1;
}//[a,b),[c,d)
//---------------------------------------------------
//+++++++++++++++++++++++++++++++++++++++++++++++++++
int n, x, y;
int t[300], h[300], dp[301][301][601];
signed main() {
	cin >> x >> y >> n;
	for (int i = 0; i < n; i++)
		cin >> t[i] >> h[i];
	for (int i = 0; i < n; i++)
		for (int j = 0; j <= x; j++)
			for (int z = 0; z <= x + y; z++)
				dp[i][j][z] = -1;
	dp[0][0][0] = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < x; j++) {
			for (int z = 0; z <= x + y; z++) {
				if (dp[i][j][z] == -1) continue;
				dp[i + 1][j][z] = max(dp[i + 1][j][z], dp[i][j][z]);
				if (z + t[i] > x + y) continue;
				dp[i + 1][j + 1][z + t[i]] = max(dp[i + 1][j + 1][z + t[i]], dp[i][j][z] + h[i]);
			}
		}
	}
	int sum = 0;
	for (int i = 0; i <= n; i++)
		for (int j = 0; j <= x; j++)
			for (int z = 0; z <= x + y; z++)
				sum = max(sum, dp[i][j][z]);
	cout << sum << endl;
	getchar(); getchar();
}

Submission Info

Judge Result