oj.uz

Submission #966364

# Submission time Handle Problem Language Result Execution time Memory
966364 2024-04-19T18:17:48 Z njoop Best Place (NOI17_bestplace) C++14
100 / 100
 32 ms 1296 KB 
#include <bits/stdc++.h>
using namespace std;

int n, x[100010], y[100010];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    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];
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 348 KB Output is correct
2 Correct 1 ms 348 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1116 KB Output is correct
2 Correct 19 ms 1112 KB Output is correct
3 Correct 18 ms 1116 KB Output is correct
4 Correct 14 ms 1160 KB Output is correct
5 Correct 17 ms 1112 KB Output is correct
6 Correct 22 ms 1112 KB Output is correct
7 Correct 18 ms 1116 KB Output is correct
8 Correct 18 ms 1116 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 1 ms 348 KB Output is correct
3 Correct 1 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 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 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 348 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 348 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 1204 KB Output is correct
2 Correct 32 ms 1276 KB Output is correct
3 Correct 19 ms 1116 KB Output is correct
4 Correct 25 ms 1296 KB Output is correct
5 Correct 27 ms 1116 KB Output is correct
6 Correct 27 ms 1116 KB Output is correct
7 Correct 27 ms 1112 KB Output is correct
8 Correct 27 ms 1116 KB Output is correct