Submission #471361

#	Time	Username	Problem	Language	Result	Execution time	Memory
471361		grimzzz404	Best Place (NOI17_bestplace)	C++17	100 / 100	50 ms	3032 KiB

bestplace

/**
 *	 Author: grimzzz404
**/


#include <bits/stdc++.h>
using namespace std;

#define FOR(x) for (int i = 0; i < (x); ++i)
#define FOR_(x,y) for (int i = (x); i < (y); ++i)
#define watch(x) cout << (#x) << " is " << (x) << endl
#define vi vector<int>
#define ll long long
#define ld long double
#define pb push_back
#define ppb pop_back
#define p push
#define pp pop
#define mp make_pair
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define sz(x) (x).size
#define endl '\n'

void solve();

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    FOR(t)
	{
        //cout << "Test Case #" << i + 1 << '\n';
        solve();
    }
    return 0;
}
void solve()
{
    int n;
    cin >> n;
    int one[n];
    int two[n];
    for (int i = 0; i < n; i++)
    {
        cin >> one[i] >> two[i];
    }
    sort(one,one+n);
    sort(two,two+n);
    int c = n/2;
    cout << one[c] << " " << two[c];

   
}

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