oj.uz

Submission #966362

# Submission time Handle Problem Language Result Execution time Memory
966362 2024-04-19T18:17:08 Z jadai007 Best Place (NOI17_bestplace) C++14
100 / 100
 30 ms 3300 KB 
#include<bits/stdc++.h>
#define int long long

using namespace std;

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

signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i = 1; i<=n; ++i) cin >> x[i] >> y[i];
    sort(x+1, x+1+n); sort(y+1, y+1+n);
    cout << x[(n+1)/2] << ' ' << y[(n+1)/2];
}

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 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 596 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 13 ms 1872 KB Output is correct
2 Correct 18 ms 1884 KB Output is correct
3 Correct 21 ms 2628 KB Output is correct
4 Correct 15 ms 2616 KB Output is correct
5 Correct 17 ms 2652 KB Output is correct
6 Correct 19 ms 2652 KB Output is correct
7 Correct 19 ms 2652 KB Output is correct
8 Correct 18 ms 2780 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 508 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 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 30 ms 1816 KB Output is correct
2 Correct 27 ms 3284 KB Output is correct
3 Correct 19 ms 3160 KB Output is correct
4 Correct 26 ms 2652 KB Output is correct
5 Correct 28 ms 3152 KB Output is correct
6 Correct 27 ms 3160 KB Output is correct
7 Correct 28 ms 3300 KB Output is correct
8 Correct 27 ms 3160 KB Output is correct