Submission #545346

#TimeUsernameProblemLanguageResultExecution timeMemory
545346Trisanu_DasBest Place (NOI17_bestplace)C++17
48 / 100
88 ms2240 KiB
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 100000;
 int N, X[MAXN], Y[MAXN];
 
int main(){
  cin >> N;
  for (int i = 0; i < N; ++i) {
  	cin >> X[i] >> Y[i];
  }
  sort(X, X+N);
  cout << X[N/2] << " 0" << endl;
}
#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...