oj.uz

Submission #532977

# Submission time Handle Problem Language Result Execution time Memory
532977 2022-03-04T09:38:31 Z makanhulia Best Place (NOI17_bestplace) C++17
100 / 100
 115 ms 2984 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  int n;
  cin >> n;

  int x[n+5];
  int y[n+5];

  for(int i = 1; i<=n; i++) cin >> x[i] >> y[i];

  sort(x+1, x+n+1);
  sort(y+1, y+n+1);
  
  cout << x[(n+1)/2] << " " << y[(n+1)/2] << endl;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 316 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 276 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 2088 KB Output is correct
2 Correct 71 ms 2212 KB Output is correct
3 Correct 63 ms 2180 KB Output is correct
4 Correct 56 ms 2116 KB Output is correct
5 Correct 66 ms 2196 KB Output is correct
6 Correct 66 ms 2200 KB Output is correct
7 Correct 63 ms 2072 KB Output is correct
8 Correct 67 ms 2188 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 288 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 304 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 3 ms 208 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 2 ms 300 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 2984 KB Output is correct
2 Correct 95 ms 2984 KB Output is correct
3 Correct 80 ms 2960 KB Output is correct
4 Correct 73 ms 2244 KB Output is correct
5 Correct 106 ms 2956 KB Output is correct
6 Correct 115 ms 2960 KB Output is correct
7 Correct 106 ms 2980 KB Output is correct
8 Correct 91 ms 2956 KB Output is correct