제출 #497728

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497728		akshtsinghania	Best Place (NOI17_bestplace)	C++14	0 / 100	101 ms	8644 KiB

bestplace

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define endl "\n"

void solve(){
    int n;
    cin>>n;
    vector<pair<int,int>> p(n);
    vector<pair<int,int>> pr(n);
    for(int i=0;i<n;i++){
        cin>>p[i].first>>p[i].second;
        pr[i].first=p[i].second;
        pr[i].second=p[i].first;
    }
    sort(p.begin(),p.end());
    sort(pr.begin(),pr.end());
    int max_a = p[p.size()-1].first;
    int max_b = pr[pr.size()-1].first;
    cout<< p[round(max_a/2)].first<< " " << pr[round(max_b/2)].first<< endl;
}
signed main(){
    int t =1;
    // cin>>t;
    while(t--)solve();
    return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 20
• Subtask 3: 0 / 28
• Subtask 4: 0 / 13
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19