Submission #1233896

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233896		Geforgs	Best Place (NOI17_bestplace)	C++20	100 / 100	38 ms	1864 KiB

bestplace

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void next(vector<ll>& a){
    vector<ll> b;
    b.pb(a.back());
    a.pop_back();
    for(auto el: a){
        b.pb(el);
    }
    swap(a, b);
}

void solve(){
    ll n, i;
    cin>>n;
    vector<ll> a(n);
    vector<ll> b(n);
    for(i=0;i<n;++i){
        cin>>a[i]>>b[i];
    }
    sort(a);
    sort(b);
    cout<<a[n/2]<<' '<<b[n/2]<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 20 / 20
• Subtask 3: 28 / 28
• Subtask 4: 13 / 13
• Subtask 5: 17 / 17
• Subtask 6: 19 / 19