Submission #484748

# Submission time Handle Problem Language Result Execution time Memory
484748 2021-11-05T10:58:31 Z Hargun02 Best Place (NOI17_bestplace) C++14
100 / 100
40 ms 3844 KB
#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long int n;
    cin >> n;
    vector < long long int > x(n);
    vector < long long int> y(n);
    for(int i = 0; i < n; i++){
        cin >> x[i];
        cin >> y[i];
    }
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    cout << x[ceil(n/2)] << ' ' << y[ceil(n/2)];
}
# 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 312 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 18 ms 1896 KB Output is correct
2 Correct 21 ms 3060 KB Output is correct
3 Correct 22 ms 3056 KB Output is correct
4 Correct 21 ms 3032 KB Output is correct
5 Correct 20 ms 3020 KB Output is correct
6 Correct 22 ms 3060 KB Output is correct
7 Correct 22 ms 2900 KB Output is correct
8 Correct 23 ms 3020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 0 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 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 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 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 40 ms 1868 KB Output is correct
2 Correct 32 ms 3788 KB Output is correct
3 Correct 25 ms 3844 KB Output is correct
4 Correct 30 ms 3012 KB Output is correct
5 Correct 32 ms 3800 KB Output is correct
6 Correct 32 ms 3796 KB Output is correct
7 Correct 32 ms 3804 KB Output is correct
8 Correct 32 ms 3812 KB Output is correct