Submission #616866

#TimeUsernameProblemLanguageResultExecution timeMemory
6168661neSails (IOI07_sails)C++14
30 / 100
1079 ms6220 KiB
#include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n;cin>>n; vector<pair<int,int>>arr(n); vector<long long>v(100001,0); for (int i = 0;i<n;++i){ cin>>arr[i].first>>arr[i].second; } sort(arr.begin(),arr.end(),[&](auto x,auto y){ return x.first < y.first; }); long long ans = 0; for (int i = 0;i<n;++i){ priority_queue<pair<long long,long long>>q; for (int j = 0;j<arr[i].first;++j){ q.push({-v[j],j}); } for (int j = 0;j<arr[i].second;++j){ auto u = q.top(); q.pop(); ans+=-u.first; v[u.second]++; } } cout<<ans<<'\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...