oj.uz

Submission #782933

# Submission time Handle Problem Language Result Execution time Memory
782933 2023-07-14T11:36:47 Z Petrix Best Place (NOI17_bestplace) C++17
100 / 100
 68 ms 1180 KB 
#include <iostream>
#include <algorithm>
using namespace std;

int a[100001],b[100001];

int main()
{
    int n,i;
    cin>>n;
    for(i=0;i<n;i++){
        cin>>a[i]>>b[i];
    }
    sort(a,a+n);sort(b,b+n);
    cout<<a[n/2]<<" "<<b[n/2];
    return 0;
}

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 964 KB Output is correct
2 Correct 45 ms 1024 KB Output is correct
3 Correct 45 ms 972 KB Output is correct
4 Correct 40 ms 960 KB Output is correct
5 Correct 49 ms 1180 KB Output is correct
6 Correct 46 ms 1004 KB Output is correct
7 Correct 44 ms 984 KB Output is correct
8 Correct 46 ms 1040 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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 1064 KB Output is correct
2 Correct 66 ms 972 KB Output is correct
3 Correct 59 ms 1144 KB Output is correct
4 Correct 51 ms 1060 KB Output is correct
5 Correct 67 ms 968 KB Output is correct
6 Correct 66 ms 956 KB Output is correct
7 Correct 66 ms 956 KB Output is correct
8 Correct 68 ms 1020 KB Output is correct