Submission #482700

#	Time	Username	Problem	Language	Result	Execution time	Memory
482700		Sneha_codes	Best Place (NOI17_bestplace)	C++14	100 / 100	40 ms	3032 KiB

bestplace

#include <bits/stdc++.h>
 
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define debug(x) cerr << #x << " = " << x << endl
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
 
void solve() {
    int n;
    cin >> n;
    vi vx(n), vy(n);
 
    rep (i, 0, n) {
        cin >> vx[i] >> vy[i];
    }
 
    sort(all(vx));
    sort(all(vy));
    cout << vx[n / 2] << ' ' << vy[n / 2] << endl;
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int tt = 1;
 
    for (int i = 1; i <= tt; ++i) {
        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