oj.uz

Submission #515146

# Submission time Handle Problem Language Result Execution time Memory
515146 2022-01-19T03:56:17 Z Joo Best Place (NOI17_bestplace) C++17
100 / 100
 40 ms 3024 KB 
#include <bits/stdc++.h>
using namespace std;


int main(void){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    int x[n+10], y[n+10];
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> y[i];
    }
    
    sort(x+1, x+n+1);
    sort(y+1, y+n+1);

    int med = (n+1)/2;

    cout << x[med] << " " << y[med] << "\n";

    return 0;   
}

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 316 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 316 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 18 ms 2092 KB Output is correct
2 Correct 24 ms 2204 KB Output is correct
3 Correct 29 ms 2236 KB Output is correct
4 Correct 24 ms 2336 KB Output is correct
5 Correct 26 ms 2232 KB Output is correct
6 Correct 25 ms 2236 KB Output is correct
7 Correct 22 ms 2076 KB Output is correct
8 Correct 28 ms 2248 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 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 324 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 3024 KB Output is correct
2 Correct 34 ms 2972 KB Output is correct
3 Correct 22 ms 2976 KB Output is correct
4 Correct 34 ms 2208 KB Output is correct
5 Correct 36 ms 2984 KB Output is correct
6 Correct 33 ms 2976 KB Output is correct
7 Correct 40 ms 2992 KB Output is correct
8 Correct 35 ms 2992 KB Output is correct