Submission #494371

#TimeUsernameProblemLanguageResultExecution timeMemory
494371stefantagaSails (IOI07_sails)C++14
25 / 100
1099 ms2636 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; bool compare (pair <ll,ll> a,pair <ll,ll > b) { return a.first<b.first||(a.first==b.first&&a.second>b.second); } ll n,i,h,k,j,maxi; long long sum; pair <ll,ll> sal[100005]; ll v[100005]; int main() { ios_base :: sync_with_stdio(false); cin.tie(0); #ifdef HOME ifstream cin("date.in"); ofstream cout("date.out"); #endif // HOME cin>>n; for (i=1;i<=n;i++) { cin>>h>>k; maxi=max(maxi,h); for (j=1;j<=h;j++) { sal[j]={v[j],j}; } sort (sal+1,sal+h+1,compare); for (j=1;j<=k;j++) { v[sal[j].second]++; } } for (j=1;j<=maxi;j++) { sum=sum+(1LL*v[j]*(v[j]-1)/2); } cout<<sum; 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...