oj.uz

Submission #730046

# Submission time Handle Problem Language Result Execution time Memory
730046 2023-04-25T07:28:01 Z Akshat369 Best Place (NOI17_bestplace) C++17
100 / 100
 39 ms 3804 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
#define endl '\n'
//#define size size()
const int mod = 1000 * 1000 * 1000 + 7;
const int N = 100005;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);



        int n;
        cin>>n;
        int a[n] , b[n];
    for (int 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]<<endl;
        //cout<<v[n/2].second;
    }

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 0 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 21 ms 1884 KB Output is correct
2 Correct 22 ms 1876 KB Output is correct
3 Correct 21 ms 1884 KB Output is correct
4 Correct 16 ms 1876 KB Output is correct
5 Correct 20 ms 1876 KB Output is correct
6 Correct 24 ms 1876 KB Output is correct
7 Correct 21 ms 1748 KB Output is correct
8 Correct 21 ms 1876 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 324 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 212 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 332 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
8 Correct 1 ms 340 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1876 KB Output is correct
2 Correct 38 ms 3796 KB Output is correct
3 Correct 27 ms 3764 KB Output is correct
4 Correct 39 ms 3000 KB Output is correct
5 Correct 34 ms 3784 KB Output is correct
6 Correct 35 ms 3796 KB Output is correct
7 Correct 37 ms 3780 KB Output is correct
8 Correct 34 ms 3804 KB Output is correct