# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91876 | Alisabzi | Art Exhibition (JOI18_art) | C++14 | 217 ms | 21100 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 F first
#define S second
typedef long long ll ;
const ll N = 5000011 ;
pair<ll,int> P[N] ;
int n ;
ll a , b, ans;
int main ()
{
scanf("%d", &n) ;
for(int i = 1 ; i <= n ; i ++){
scanf("%lld%lld", &a, &b) ;
P[i].F = a, P[i].S = b;
}
sort(P+1, P+n+1) ;
ans = a = P[1].S ;
b = 0 ;
for(int i = 2 ; i <= n ; i ++){
b = max(a+P[i].S-(P[i].F-P[i-1].F), (ll)P[i].S) ;
ans = max(ans, b) ;
a = b ;
}
printf("%lld", 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |