oj.uz

Submission #742271

# Submission time Handle Problem Language Result Execution time Memory
742271 2023-05-16T03:44:29 Z jadai007 Best Place (NOI17_bestplace) C++14
100 / 100
 38 ms 1236 KB 
#include<bits/stdc++.h>

using namespace std;

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

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

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1076 KB Output is correct
2 Correct 25 ms 1068 KB Output is correct
3 Correct 21 ms 1108 KB Output is correct
4 Correct 16 ms 1108 KB Output is correct
5 Correct 19 ms 1128 KB Output is correct
6 Correct 22 ms 1108 KB Output is correct
7 Correct 22 ms 1212 KB Output is correct
8 Correct 24 ms 1204 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1016 KB Output is correct
2 Correct 32 ms 980 KB Output is correct
3 Correct 22 ms 1236 KB Output is correct
4 Correct 30 ms 1108 KB Output is correct
5 Correct 32 ms 1120 KB Output is correct
6 Correct 32 ms 1172 KB Output is correct
7 Correct 33 ms 1236 KB Output is correct
8 Correct 38 ms 1228 KB Output is correct