# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787268 | guagua0407 | Art Exhibition (JOI18_art) | C++17 | 201 ms | 23956 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.
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int main() {_
int n;
cin>>n;
pair<ll,ll> num[n+1];
for(int i=1;i<=n;i++){
cin>>num[i].f>>num[i].s;
}
sort(num+1,num+(n+1));
vector<ll> pre(n+1,0);
for(int i=1;i<=n;i++){
pre[i]=pre[i-1]+num[i].s;
}
priority_queue<pair<ll,ll>> pq;
for(int i=1;i<=n;i++){
pq.push({pre[i]-num[i].f,i});
}
ll ans=0;
for(int i=1;i<=n;i++){
while(pq.top().s<i){
pq.pop();
}
auto v=pq.top();
ans=max(ans,-pre[i-1]+num[i].f+v.f);
}
cout<<ans<<'\n';
return 0;
}
//maybe its multiset not set
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... |