제출 #1237203

#제출 시각아이디문제언어결과실행 시간메모리
1237203denislavSails (IOI07_sails)C++20
5 / 100
1096 ms1340 KiB
# include <iostream> # include <algorithm> using namespace std; const int MAX=1e5+11; int n; pair<int,int> a[MAX]; int c[MAX]; bool ban[MAX]; int main() { ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); cin>>n; for(int i=1;i<=n;i++) cin>>a[i].first>>a[i].second; sort(a+1,a+n+1); long long ans=0; for(int t=n;t>=1;t--) { for(int i=a[t].first;i>=1;i--) ban[i]=0; while(a[t].second--) { int pos=-1; for(int i=a[t].first;i>=1;i--) { if(ban[i]) continue; if(pos==-1 or c[i]<c[pos]) pos=i; } ans+=c[pos]; c[pos]++; ban[pos]=1; } } 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...