oj.uz

Submission #970334

# Submission time Handle Problem Language Result Execution time Memory
970334 2024-04-26T11:16:04 Z VMaksimoski008 Best Place (NOI17_bestplace) C++17
100 / 100
 72 ms 1200 KB 
#include <bits/stdc++.h>
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] << '\n';
}

Subtask #1
3.0 / 3.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1116 KB Output is correct
2 Correct 44 ms 1116 KB Output is correct
3 Correct 44 ms 1116 KB Output is correct
4 Correct 42 ms 1116 KB Output is correct
5 Correct 43 ms 1112 KB Output is correct
6 Correct 44 ms 1112 KB Output is correct
7 Correct 43 ms 1116 KB Output is correct
8 Correct 50 ms 1112 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 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 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 416 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 436 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 69 ms 1116 KB Output is correct
2 Correct 68 ms 1184 KB Output is correct
3 Correct 57 ms 1184 KB Output is correct
4 Correct 50 ms 1116 KB Output is correct
5 Correct 66 ms 1196 KB Output is correct
6 Correct 66 ms 1188 KB Output is correct
7 Correct 65 ms 1116 KB Output is correct
8 Correct 72 ms 1200 KB Output is correct