# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136265 | KLPP | Art Exhibition (JOI18_art) | C++14 | 278 ms | 24684 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;
typedef long long int lld;
typedef pair<lld,lld> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)
int main(){
int n;
scanf("%d",&n);
pii arr[n];
rep(i,0,n){
scanf("%lld %lld",&arr[i].first,&arr[i].second);
}
sort(arr,arr+n);
lld DP[n];
DP[0]=arr[0].second;
rep(i,1,n){
DP[i]=arr[i].second;
DP[i]=max(DP[i],DP[i-1]+arr[i].second-(arr[i].first-arr[i-1].first));
}
lld ans=0;
rep(i,0,n)ans=max(ans,DP[i]);
printf("%lld\n",ans);
return 0;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |