이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define each(i,a) for(auto&& i : a)
int main(){
int n;
cin >> n;
vector<pair<int, int>> a(n);
each(i, a) cin >> i.first >> i.second;
sort(a.begin(), a.end());
multiset<int> X;
X.insert(0);
each(i, a){
auto [h, k] = i;
X.insert(h);
auto p = X.upper_bound(h - k), q = prev(p);
int next = *q + *p - h + k;
if(q != X.begin()) X.erase(q);
X.insert(next);
X.erase(p);
}
long ans = 0, cnt = 0;
for(auto p = X.end(); p-- != X.begin(); cnt++) ans += cnt * *p;
cout << ans << endl;
}
| # | 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... |
| # | 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... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |