hack 1.00s 超时求调
查看原帖
hack 1.00s 超时求调
1241185
yi105011楼主2024/8/18 16:12

提交记录
代码

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n , m , dp[10000010] , a[50][2] , b , c , k;
signed main () {
	cin >> n >> k >> m;
	for (int i = 1;i <= m;i ++) cin >> a[i][0] >> a[i][1];
	while (k --) {
		memset (dp , 0 ,sizeof (dp));
		for (int i = 1;i <= m;i ++) 
			for (int z = a[i][0];z <= n;z ++)
				dp[z] = max (dp[z] , dp[z - a[i][0]] + a[i][1]);
		n += dp[n];
	}
	cout << n;
	return 0;
}

2024/8/18 16:12
加载中...