Submission #1187494

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<iterator>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long int lli;
typedef pair<int, int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define pque(type) priority_queue<type,vector<type>,greater<type> >
#define memst(a,b) memset(a,b,sizeof(a))

int x, y, z, n, m;
vector<pair<lli, lli>> t;
vector<vector<vector<lli>>> dp;



int main(void){
	cin >> x >> y >> n; z = x + y; m = min(x, n);
	t.resize(n+1);
	reg(i, 1, n) cin >> t[i].fir >> t[i].sec;
	dp.assign(z+1, vector<vector<lli>>(m+1, vector<lli>(n+1, -1)));
	
	rep(i, m+1) rep(j, n+1) dp[0][i][j] = 0;
	rep(i, z+1) rep(j, n+1) dp[i][0][j] = 0;
	rep(i, z+1) rep(j, m+1) dp[i][j][0] = 0;
	
	rep(j, n+1){
		rep(k, m+1){
			rep(i, z+1){
				if(i+t[j+1].fir <= z && k+1 <= m && j+1 <= n) dp[i+t[j+1].fir][k+1][j+1] = max(dp[i+t[j+1].fir][k+1][j+1], dp[i][k][j]+t[j+1].sec);
				if(j+1 <= n) dp[i][k][j+1] = max(dp[i][k][j+1], dp[i][k][j]);
			}
		}
	}
	
	lli ans = 0;
	rep(k, m+1){
		rep(i, z+1){
			ans = max(ans, dp[i][k][n]);
		}
	}

	cout << ans << endl;
	
	return 0;
}

Submission Info

Judge Result