oj.uz

Submission #522629

# Submission time Handle Problem Language Result Execution time Memory
522629 2022-02-05T09:40:17 Z lucri Best Place (NOI17_bestplace) C++17
100 / 100
 117 ms 3776 KB 
#include <iostream>
#include <algorithm>
using namespace std;
long long n,x[100010],y[100010];
int main()
{
    cin>>n;
    for(int i=1;i<=n;++i)
    {
        cin>>x[i]>>y[i];
    }
    sort(x+1,x+n+1);
    sort(y+1,y+n+1);
    cout<<x[(n+1)/2]<<' '<<y[(n+1)/2];
    return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

# 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 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 304 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 50 ms 1740 KB Output is correct
2 Correct 61 ms 1780 KB Output is correct
3 Correct 62 ms 2968 KB Output is correct
4 Correct 53 ms 2896 KB Output is correct
5 Correct 70 ms 2992 KB Output is correct
6 Correct 65 ms 2888 KB Output is correct
7 Correct 59 ms 2900 KB Output is correct
8 Correct 59 ms 2980 KB Output is correct

Subtask #4
13.0 / 13.0

# 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 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 204 KB Output is correct
2 Correct 2 ms 288 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 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 312 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 1840 KB Output is correct
2 Correct 84 ms 3776 KB Output is correct
3 Correct 80 ms 3732 KB Output is correct
4 Correct 65 ms 2992 KB Output is correct
5 Correct 99 ms 3684 KB Output is correct
6 Correct 117 ms 3768 KB Output is correct
7 Correct 106 ms 3760 KB Output is correct
8 Correct 86 ms 3756 KB Output is correct