제출 #847913

#제출 시각아이디문제언어결과실행 시간메모리
847913vjudge1Unija (COCI17_unija)C++17
10 / 100
559 ms23756 KiB
#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 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...