Submission #965905

#TimeUsernameProblemLanguageResultExecution timeMemory
965905North1304Best Place (NOI17_bestplace)C++14
100 / 100
33 ms8540 KiB
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 1;
int x[N] , y[N];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int n; cin >> n;
    for(int i=1;i<=n;i++) cin >> x[i] >> y[i];
    sort(x+1, x+n+1);
    sort(y+1, y+n+1);
    cout << x[(n+1)/2] << ' ' << y[(n+1)/2];
    return 0;
}
#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...