Submission #931128

# Submission time Handle Problem Language Result Execution time Memory
931128 2024-02-21T09:49:09 Z Laav10 Best Place (NOI17_bestplace) C++14
100 / 100
32 ms 4072 KB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define INF(t) numeric_limits<t>::max()

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0); cerr.tie(0);

	ll N,i;
	cin>>N;
	vector<ll> X(N), Y(N);
	for(i=0; i<N; i++)
	{
		cin>>X[i]>>Y[i];
	}
	sort(X.begin(), X.end());
	sort(Y.begin(), Y.end());

	cout<< X[ceil(N/2)]<<" "<<Y[ceil(N/2)];

}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 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 1 ms 480 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 1884 KB Output is correct
2 Correct 19 ms 3164 KB Output is correct
3 Correct 19 ms 3164 KB Output is correct
4 Correct 16 ms 3164 KB Output is correct
5 Correct 18 ms 3164 KB Output is correct
6 Correct 22 ms 3028 KB Output is correct
7 Correct 19 ms 2908 KB Output is correct
8 Correct 20 ms 3160 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
# 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 464 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 28 ms 2136 KB Output is correct
2 Correct 28 ms 4072 KB Output is correct
3 Correct 19 ms 3928 KB Output is correct
4 Correct 25 ms 3052 KB Output is correct
5 Correct 28 ms 3932 KB Output is correct
6 Correct 28 ms 3928 KB Output is correct
7 Correct 28 ms 3936 KB Output is correct
8 Correct 32 ms 3948 KB Output is correct