Submission #494280

#TimeUsernameProblemLanguageResultExecution timeMemory
494280CjSidharthBest Place (NOI17_bestplace)C++14
28 / 100
85 ms1868 KiB
#include<bits/stdc++.h>
#define REP(i,a,b) for(int i = a; i < b;i++)
typedef long long int ll;
using namespace std;
int main()
{
    ll n; cin >> n;
    vector<ll> x(n), y(n);
    REP(i,0,n)
    {
        cin >> x[i] >> y[n];
    }
    sort(x.begin(),x.end());
    sort(y.begin(),y.end());
    cout<<x[n/2]<<" "<<y[n/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...