| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1369782 | c12 | Art Exhibition (JOI18_art) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
ll mn = 0;
ll sum = 0;
vector<pair<ll,ll>>vec(n);
for(int i = 0;i < n;i++){
cin >> vec[i].first >> vec[i].second;
}
ll mx = 0;
sort(vec.begin(),vec.end());
for(int i = 0;i < n;i++){
mx = max(mx,(sum + vec[i].second) - vec[i].first + mn);
mn = max(mn,vec[i].first - sum);
sum += vec[i].second;
}
cout << mx;
}
/*
Pre[i] - pre[j] - A[i] + A[j]
pre[i] - A[i] + ( - pre[j-1] + A[j])
*/| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
