이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> v[100001];
for(int i = 0;i<n;i++){
int a,b;cin>>a>>b;
v[a].push_back(b);
}
long long l = 1 , r = 10000000 , ans = -1;
while(l<=r){
int mid = (l+r)/2;
long long all = 0;
priority_queue<long long> ve;
for(int i = 100000;i>=1;i--){
for(auto j:v[i]){
ve.push(j);
}
long long sz = min(int(ve.size()),mid);
all+=(sz*(sz-1))/2;
vector<int> xd;
while(sz--){
xd.push_back(ve.top()-1);
ve.pop();
}
for(auto j:xd){if(j)ve.push(j);}
}
if(ve.empty()){
ans = all;
r = mid-1;
}else{
l = mid+1;
}
}
cout<<ans<<endl;
}
# | 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... |