oj.uz

Submission #383454

# Submission time Handle Problem Language Result Execution time Memory
383454 2021-03-29T23:00:02 Z MODDI Best Place (NOI17_bestplace) C++14
100 / 100
 112 ms 3180 KB 
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
using namespace std;
int main(){
	int n;
	cin>>n;
	int x[n], y[n];
	for(int i = 0; i < n; i++){
		cin>>x[i]>>y[i];
	}
	sort(x, x + n);
	sort(y, y + n);
	cout<<x[n/2]<<" "<<y[n/2]<<endl;
	return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 2156 KB Output is correct
2 Correct 72 ms 2284 KB Output is correct
3 Correct 83 ms 2284 KB Output is correct
4 Correct 67 ms 2284 KB Output is correct
5 Correct 71 ms 2284 KB Output is correct
6 Correct 71 ms 2284 KB Output is correct
7 Correct 68 ms 2156 KB Output is correct
8 Correct 70 ms 2284 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 3052 KB Output is correct
2 Correct 108 ms 3180 KB Output is correct
3 Correct 96 ms 3052 KB Output is correct
4 Correct 79 ms 2388 KB Output is correct
5 Correct 99 ms 3052 KB Output is correct
6 Correct 110 ms 3124 KB Output is correct
7 Correct 98 ms 3052 KB Output is correct
8 Correct 112 ms 3180 KB Output is correct