Submission #494283

#TimeUsernameProblemLanguageResultExecution timeMemory
494283CjSidharthBest Place (NOI17_bestplace)C++14
0 / 100
94 ms3416 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,x1,y1; cin >> n;
    vector<ll> x(n), y(n);
    REP(i,0,n)
    {
        cin >> x1 >> y1;
        x.push_back(x1);y.push_back(y1);
    }
    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...