Submission #1676441

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000000000000000000000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)                                                                             
#define seg_size 524288
long long dp[400][700] = {};
int main() {
	long long x, y;
	cin >> x >> y;
	long long n;
	long long ans = 0;
	cin >> n;
	for (int i = 0;i < n;++i) {
		long long a, b;
		cin >> a >> b;
		for (int q = x-1;q >= 0;--q) {
			if (x + y - a >= 0) {
				for (int j = 0;j <= x + y - a;++j) {
					dp[q + 1][j + a] = max(dp[q + 1][j + a], dp[q][j] + b);
					if (ans < dp[q + 1][j + a]) {
						ans = max(ans, dp[q + 1][j + a]);
					}
				}
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result