# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
137940 | zoooma13 | Cake 3 (JOI19_cake3) | C++14 | 35 ms | 31736 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 2003
#define INF 0x3f3f3f3f3f3f3f3f
#define c first
#define v second
int n ,m;
pair<int ,int> piece[MAX_N];
long long dp[MAX_N][MAX_N];
long long solve(int p ,int l){
if(l == 0)
return -2LL*piece[p-1].c;
if(p == n)
return -INF;
auto&ret = dp[p][l];
if(~ret)
return ret;
return ret = max(piece[p].v+solve(p+1 ,l-1) ,solve(p+1 ,l));
}
int main()
{
scanf("%d%d",&n,&m); assert(n < MAX_N);
for(int i=0; i<n; i++)
scanf("%d%d",&piece[i].v,&piece[i].c);
sort(piece ,piece+n);
memset(dp ,-1 ,sizeof dp);
long long ans = 0LL;
for(int i=0; i<n; i++)
ans = max(ans ,solve(i+1 ,m-1)+piece[i].v+2LL*piece[i].c);
printf("%lld\n",ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |