[AcWing 1022] 宠物小精灵之收服

#include<iostream>

using namespace std;

const int N = 1010, M = 510;

int V1, V2, n;
int v1[N], v2[N];
int f[N][M];

int main()
{
	cin >> V1 >> V2 >> n;
	for (int i = 1; i <= n; i ++)	cin >> v1[i] >> v2[i];
	for (int i = 1; i <= n; i ++)
		for (int j = V1; j >= v1[i]; j --)
			for (int k = V2 - 1; k >= v2[i]; k --)
				f[j][k] = max(f[j][k], f[j - v1[i]][k - v2[i]] + 1);
	cout << f[V1][V2 - 1] << ' ';
	int k = V2 - 1;
	while (k > 0 && f[V1][k - 1] == f[V1][V2 - 1])	k --;
	cout << V2 - k << endl;
	return 0;
}