# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115495 | thebes | Sails (IOI07_sails) | C++14 | 1072 ms | 3692 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;
typedef long long ll;
priority_queue<ll> q;
ll N, i, nxt=1, ans; vector<ll> tmp;
pair<ll,ll> arr[100005];
int main(){
for(scanf("%lld",&N),i=1;i<=N;i++)
scanf("%lld%lld",&arr[i].first,&arr[i].second);
sort(arr+1,arr+N+1,[](pair<ll,ll>i,pair<ll,ll>j){return i.first<j.first;});
for(i=1;i<=N;i++){
while(nxt<=arr[i].first) q.push(0), nxt++;
while(arr[i].second--){
ans += -q.top(); tmp.push_back(q.top()-1); q.pop();
}
for(auto v : tmp) q.push(v);
tmp.clear();
}
printf("%lld\n",ans);
return 0;
}
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... |
# | 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... |