# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071965 | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 155 ms | 12140 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 int long long
#define nn "\n";
#define pb push_back
#define fi first
#define se second
const int N = 1e6 + 8 , inf = 1e17 ;
int n , m , q ;
pair<int , int >a[N];
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin>> n ;
vector<pair<int, int >> v ;
int ok =-inf , mx1 =0 ;
for(int i = 1; i <= n; i++){
cin>> a[i].fi>>a[i].se;
}
sort(a + 1, a + n + 1 );
int p[n+1] ,mx =0 , ans =0 ;
p[0] =0 ;
for(int i =1 ; i <= n; i++){
p[i] = p[i-1]+a[i].se;
mx = max(mx , a[i].fi - p[i-1]);
ans = max(ans , p[i] - a[i].fi + mx);
}
cout << 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... |