oj.uz

Submission #507585

# Submission time Handle Problem Language Result Execution time Memory
507585 2022-01-12T18:44:30 Z aadeazm Best Place (NOI17_bestplace) C++14
100 / 100
 92 ms 2280 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];
    return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.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 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 296 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 2088 KB Output is correct
2 Correct 60 ms 2116 KB Output is correct
3 Correct 59 ms 2116 KB Output is correct
4 Correct 55 ms 2064 KB Output is correct
5 Correct 56 ms 2116 KB Output is correct
6 Correct 61 ms 2172 KB Output is correct
7 Correct 57 ms 2040 KB Output is correct
8 Correct 61 ms 2280 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 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 1 ms 204 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 2136 KB Output is correct
2 Correct 88 ms 2256 KB Output is correct
3 Correct 77 ms 2224 KB Output is correct
4 Correct 68 ms 2204 KB Output is correct
5 Correct 92 ms 2244 KB Output is correct
6 Correct 92 ms 2244 KB Output is correct
7 Correct 86 ms 2244 KB Output is correct
8 Correct 90 ms 2216 KB Output is correct