Submission #545346

# Submission time Handle Problem Language Result Execution time Memory
545346 2022-04-04T09:58:03 Z Trisanu_Das Best Place (NOI17_bestplace) C++17
48 / 100
88 ms 2240 KB
#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 time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 54 ms 1032 KB Output is correct
2 Correct 64 ms 2124 KB Output is correct
3 Correct 67 ms 2124 KB Output is correct
4 Correct 60 ms 2204 KB Output is correct
5 Correct 69 ms 2184 KB Output is correct
6 Correct 63 ms 2144 KB Output is correct
7 Correct 62 ms 2160 KB Output is correct
8 Correct 72 ms 2240 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 88 ms 988 KB Output isn't correct
2 Halted 0 ms 0 KB -