| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1339372 | uranhishig | Art Exhibition (JOI18_art) | C++20 | 414 ms | 12080 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
vector<int> p(n + 1, 0);
for (int i = 0; i < n; i++) {
p[i + 1] = p[i] + v[i].second;
}
int ma = -1e18;
int mi = 1e18;
for (int i = 0; i < n; i++){
mi = min(mi, p[i]-v[i].first);
ma = max(ma, p[i+1]-v[i].first-mi);
}
cout << ma;
return 0;
}| # | 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... | ||||
