#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=2e5;
const ll inf=1e18;
const ll mod=1e9+7;
ll n;
struct qq
{
ll c,f,v;
bool operator<(const qq&o)
{
if(f==o.f) return c>o.c;
return f>o.f;
}
}p[maxN];
ll m;
ll dp[maxN];
ll ans=0;
void solve()
{
cin >> n;
ll sum=0;
for(int i=1;i<=n;i++)
{
cin >> p[i].c >> p[i].f >> p[i].v;
sum+=p[i].c;
p[i].v*=-1;
}
cin >> m;
for(int i=n+1;i<=n+m;i++)
{
cin >>p[i].c >> p[i].f >> p[i].v;
p[i].c*=-1;
}
sort(p+1,p+m+n+1);
for(int i=0;i<=sum;i++) dp[i]=-inf;
dp[0]=0;
for(int i=1;i<=m+n;i++)
{
//cout << p[i].c <<' '<<p[i].f <<' '<<p[i].v<<'\n';
if(p[i].c<0)
{
for(int j=0;j<=sum+p[i].c;j++)
{
dp[j]=max(dp[j],dp[j-p[i].c]+p[i].v);
}
}
else
{
for(int j=sum;j>=p[i].c;j--)
{
dp[j]=max(dp[j],dp[j-p[i].c]+p[i].v);
}
}
}
for(int j=0;j<=sum;j++) ans=max(ans,dp[j]);
cout << ans;
}
int main()
{
fastio
//freopen(TASKNAME".INP","r",stdin);
//freopen(TASKNAME".OUT","w",stdout);
solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
224 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
348 KB |
Output is correct |
8 |
Correct |
2 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
19 ms |
560 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
93 ms |
820 KB |
Output is correct |
8 |
Correct |
18 ms |
468 KB |
Output is correct |
9 |
Correct |
151 ms |
1064 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
328 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
328 KB |
Output is correct |
3 |
Correct |
6 ms |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
170 ms |
864 KB |
Output is correct |
6 |
Correct |
296 ms |
1164 KB |
Output is correct |
7 |
Correct |
290 ms |
1176 KB |
Output is correct |
8 |
Correct |
281 ms |
1132 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
17 ms |
572 KB |
Output is correct |
4 |
Correct |
4 ms |
340 KB |
Output is correct |
5 |
Correct |
306 ms |
1164 KB |
Output is correct |
6 |
Correct |
299 ms |
1144 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
224 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
348 KB |
Output is correct |
8 |
Correct |
2 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
336 KB |
Output is correct |
10 |
Correct |
1 ms |
336 KB |
Output is correct |
11 |
Correct |
0 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
19 ms |
560 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
93 ms |
820 KB |
Output is correct |
16 |
Correct |
18 ms |
468 KB |
Output is correct |
17 |
Correct |
151 ms |
1064 KB |
Output is correct |
18 |
Correct |
0 ms |
328 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
0 ms |
340 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
332 KB |
Output is correct |
24 |
Correct |
1 ms |
340 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
0 ms |
340 KB |
Output is correct |
27 |
Correct |
0 ms |
328 KB |
Output is correct |
28 |
Correct |
6 ms |
340 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
170 ms |
864 KB |
Output is correct |
31 |
Correct |
296 ms |
1164 KB |
Output is correct |
32 |
Correct |
290 ms |
1176 KB |
Output is correct |
33 |
Correct |
281 ms |
1132 KB |
Output is correct |
34 |
Correct |
0 ms |
336 KB |
Output is correct |
35 |
Correct |
1 ms |
340 KB |
Output is correct |
36 |
Correct |
17 ms |
572 KB |
Output is correct |
37 |
Correct |
4 ms |
340 KB |
Output is correct |
38 |
Correct |
306 ms |
1164 KB |
Output is correct |
39 |
Correct |
299 ms |
1144 KB |
Output is correct |
40 |
Correct |
20 ms |
560 KB |
Output is correct |
41 |
Correct |
53 ms |
596 KB |
Output is correct |
42 |
Correct |
5 ms |
464 KB |
Output is correct |
43 |
Correct |
322 ms |
1244 KB |
Output is correct |
44 |
Correct |
371 ms |
1256 KB |
Output is correct |
45 |
Correct |
346 ms |
1284 KB |
Output is correct |
46 |
Correct |
3 ms |
340 KB |
Output is correct |
47 |
Correct |
5 ms |
340 KB |
Output is correct |
48 |
Correct |
5 ms |
340 KB |
Output is correct |