oj.uz

Submission #499704

# Submission time Handle Problem Language Result Execution time Memory
499704 2021-12-29T09:32:39 Z aadi_goyal Best Place (NOI17_bestplace) C++14
100 / 100
 44 ms 3028 KB 
#include<bits/stdc++.h>
using namespace std;

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

	int n; cin >> n;
	vector<int> x(n);
	vector<int> y(n);

	for(int i = 0; i < n; i++)
	{
		cin >> x[i] >> y[i];
	}

	sort(x.begin(), x.end());
	sort(y.begin(), y.end());

	int mid = (n - 1) / 2;

	cout << x[mid] << " " << y[mid] << endl;

	return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2116 KB Output is correct
2 Correct 22 ms 2232 KB Output is correct
3 Correct 22 ms 2224 KB Output is correct
4 Correct 16 ms 2232 KB Output is correct
5 Correct 22 ms 2364 KB Output is correct
6 Correct 23 ms 2244 KB Output is correct
7 Correct 23 ms 2104 KB Output is correct
8 Correct 21 ms 2232 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2992 KB Output is correct
2 Correct 44 ms 3008 KB Output is correct
3 Correct 33 ms 2992 KB Output is correct
4 Correct 28 ms 2228 KB Output is correct
5 Correct 32 ms 3028 KB Output is correct
6 Correct 44 ms 2988 KB Output is correct
7 Correct 34 ms 3020 KB Output is correct
8 Correct 32 ms 3000 KB Output is correct