Submission #955003

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
955003	2024-03-29T06:45:56 Z	anonym1	Best Place (NOI17_bestplace)	C++14	51 / 100	22 ms	4592 KB

bestplace

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

typedef long long int ll;
typedef pair<int, int> pii;

#define endl "\n"
#define ff first
#define ss second

const int N = 2e5+20;
const ll INF = 1e18+10;
const int mod = 1e9+7;

pair<int, pii> a[N];

void solve()
{
	int n; cin >> n;
	for(int i=1; i<=n; i++){
		cin >> a[i].ss.ff >> a[i].ss.ss;
		a[i].ff = a[i].ss.ff+a[i].ss.ss;
	}

	sort(a+1, a+n+1);

	if(n%2) cout << a[n/2+1].ss.ff << " " << a[n/2+1].ss.ss << endl;
	else cout << a[n/2].ss.ff << " " << a[n/2].ss.ss << endl;

}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    // cout.precision(10);
    
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif

    int t;
    // cin >> t;
    t=1;

    for(int i=1; i<=t; i++){
        // cout << "Case #" << i << ": ";
        solve();
    }

}

Subtask #1
3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	600 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	3676 KB	Output is correct
2	Correct	18 ms	3824 KB	Output is correct
3	Correct	18 ms	3672 KB	Output is correct
4	Correct	18 ms	3808 KB	Output is correct
5	Correct	18 ms	3672 KB	Output is correct
6	Correct	19 ms	3672 KB	Output is correct
7	Correct	19 ms	3676 KB	Output is correct
8	Correct	18 ms	3676 KB	Output is correct