Submission #1331033

#TimeUsernameProblemLanguageResultExecution timeMemory
1331033boclobanchatSails (IOI07_sails)C++20
40 / 100
1096 ms2232 KiB
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+5;
int pref[MAXN];
pair<int,int> A[MAXN];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>A[i].first>>A[i].second;
    sort(A+1,A+n+1);
    priority_queue< int,vector<int>,greater<int> > pq;
    long long ans=0;
    int r=0;
    for(int i=1;i<=n;i++)
    {
    	while(r<A[i].first) r++,pq.push(0);
    	vector<int> vi;
    	for(int j=1;j<=A[i].second;j++) ans+=pq.top(),vi.push_back(pq.top()+1),pq.pop();
    	for(auto v:vi) pq.push(v);
	}
	cout<<ans;
}
#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...