oj.uz

Submission #503460

# Submission time Handle Problem Language Result Execution time Memory
503460 2022-01-08T05:02:32 Z sudheerays123 Best Place (NOI17_bestplace) C++
100 / 100
 34 ms 4016 KB 
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define tc ll test;cin >> test;while(test--)
#define vi vector<ll>
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define INF 1e18
#define MOD 1000000007
#define ff first
#define ss second
#define in >>
#define out <<
#define space << " " <<
#define spacef << " "
#define fo(i,a,b) for(ll i = a; i <= b; i++)
#define nextline out "\n"
#define print(x) for(auto i : x ) cout out i spacef
#define mmax(x,i) x = max(x,i)
#define mmin(x,i) x = min(x,i)
#define N 105

int main() {
    
    fast;

    ll n;
    cin in n;

    vi x,y;

    fo(i,1,n){
        ll a,b;
        cin in a in b;

        x.pb(a);
        y.pb(b);
    }

    sort(x.begin(),x.end());
    sort(y.begin(),y.end());

    ll ind = n/2;

    cout out x[ind] space y[ind];

    return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3116 KB Output is correct
2 Correct 24 ms 3224 KB Output is correct
3 Correct 25 ms 3180 KB Output is correct
4 Correct 19 ms 3240 KB Output is correct
5 Correct 23 ms 3164 KB Output is correct
6 Correct 23 ms 3152 KB Output is correct
7 Correct 23 ms 3096 KB Output is correct
8 Correct 25 ms 3232 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 3932 KB Output is correct
2 Correct 33 ms 3980 KB Output is correct
3 Correct 24 ms 4008 KB Output is correct
4 Correct 30 ms 3252 KB Output is correct
5 Correct 33 ms 3932 KB Output is correct
6 Correct 33 ms 4012 KB Output is correct
7 Correct 33 ms 4016 KB Output is correct
8 Correct 34 ms 3904 KB Output is correct