Submission #494276

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