Submission #1005990

#	Time	Username	Problem	Language	Result	Execution time	Memory
1005990		makanhulia	Best Place (NOI17_bestplace)	C++17	100 / 100	80 ms	1996 KiB

bestplace

//
#include <bits/stdc++.h>
using namespace std;
#define int long long
int MOD = 1e9 + 7;

void solve(){
    int n;
    cin >> n;
    int ax[n], ay[n];
    for(int i = 0; i<n; i++){
        cin >> ax[i] >> ay[i];
    }
    sort(ax, ax+n);
    sort(ay, ay+n);
    cout << ax[n/2] << " " << ay[n/2] << endl;    
}

signed main(){
  int t;
    t = 1;
    for(int i = 1; i<=t; i++){
        solve();
    }
}

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