oj.uz

Submission #925559

# Submission time Handle Problem Language Result Execution time Memory
925559 2024-02-12T04:35:29 Z shxun Best Place (NOI17_bestplace) C++17
100 / 100
 69 ms 3352 KB 
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int n; cin >> n;
    int x[n], y[n];
    for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
    sort(x, x + n);
    sort(y, y + n);
    cout << x[n / 2] << ' ' << y[n / 2];
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 2140 KB Output is correct
2 Correct 46 ms 2132 KB Output is correct
3 Correct 45 ms 2324 KB Output is correct
4 Correct 48 ms 2388 KB Output is correct
5 Correct 50 ms 2208 KB Output is correct
6 Correct 46 ms 2196 KB Output is correct
7 Correct 44 ms 2196 KB Output is correct
8 Correct 49 ms 2212 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 432 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 2904 KB Output is correct
2 Correct 68 ms 2900 KB Output is correct
3 Correct 59 ms 3352 KB Output is correct
4 Correct 52 ms 2388 KB Output is correct
5 Correct 66 ms 2896 KB Output is correct
6 Correct 67 ms 2900 KB Output is correct
7 Correct 69 ms 3092 KB Output is correct
8 Correct 65 ms 2900 KB Output is correct