oj.uz

Submission #280232

# Submission time Handle Problem Language Result Execution time Memory
280232 2020-08-22T15:07:23 Z Pbezz Best Place (NOI17_bestplace) C++14
100 / 100
 81 ms 4176 KB 
#include <bits/stdc++.h>
using namespace std;

#define loop(i,n) for (ll i = 0; i < n; i++)

#define ll long long
#define INF 100005
#define MOD 1000000007
#define pb push_back 
#define mp make_pair
typedef pair<ll,ll> pii;

const ll MAXN=1e6; 
ll a[MAXN+1];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	ll n,i,x,y;
	vector<ll>xx,yy;

	cin>>n;

	for(i=0;i<n;i++){

	cin>>x>>y;	
	xx.pb(x);
	yy.pb(y);

}

sort(xx.begin(),xx.end());
sort(yy.begin(),yy.end());



	cout<<xx[n/2]<<" "<<yy[n/2]<<endl;




return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 3284 KB Output is correct
2 Correct 40 ms 3300 KB Output is correct
3 Correct 35 ms 3300 KB Output is correct
4 Correct 23 ms 3308 KB Output is correct
5 Correct 35 ms 3324 KB Output is correct
6 Correct 45 ms 3300 KB Output is correct
7 Correct 37 ms 3308 KB Output is correct
8 Correct 32 ms 3308 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4140 KB Output is correct
2 Correct 44 ms 4148 KB Output is correct
3 Correct 37 ms 4176 KB Output is correct
4 Correct 51 ms 3488 KB Output is correct
5 Correct 81 ms 4064 KB Output is correct
6 Correct 57 ms 4064 KB Output is correct
7 Correct 52 ms 4072 KB Output is correct
8 Correct 44 ms 4076 KB Output is correct