이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,cnt=0;
cin>>n;
vector<pair<long long,long long>>v(n);
for(int i=0 ; i<n ; i++)
{
long long xx,yy;
cin>>xx>>yy;
yy/=2;xx/=2;
v[i]={xx,yy};
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
long long j=0,k=1;
cnt=0;
for(long long i=v[0].first ; i>0 ; i--)
{
if(i==v[k].first && v[k].second>v[j].second) j=k;
if (i==v[k].first)k++;
cnt+=v[j].second;
}
cout<<cnt*4<<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... |