完全背包问题,直接模板题
#include <iostream>
#include <string>
#include <algorithm>
#include <sstream>
#include <map>
#include <vector>
using namespace std;
int times[15];
int a[505];
int jc[15];
int dp[505];
vector<pair<int, int> > pra;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
pra.clear();
int l, n, m;
cin >> l >> n >> m;
fill(a, a + l + 1, 0);
for (int i = 0; i < n; i++) {
cin >> jc[i];
if (i) times[i] = jc[i] - jc[i - 1];
else times[i] = jc[i];
}
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
if (u > l) continue;
if (a[u] < v) a[u] = v;
}
for (int i = 0; i <= l; i++) {
if (a[i]) pra.push_back(make_pair(i, a[i]));
}
fill(dp, dp + 505, 0);
for (int i = 0; i < pra.size(); i++) {
for (int v = 0; v < 505; v++) {
if (v - pra[i].first >= 0) dp[v] = max(dp[v], dp[v - pra[i].first] + pra[i].second);
}
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += dp[times[i]];
}
sum += dp[l - jc[n - 1]];
cout << sum << "\n";
}
}