oj.uz

Submission #676471

# Submission time Handle Problem Language Result Execution time Memory
676471 2022-12-31T03:33:14 Z penguin133 Best Place (NOI17_bestplace) C++17
100 / 100
 119 ms 4016 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
	ll n;
	cin >> n;
	ll a,b;
	priority_queue<ll>pq;
	priority_queue<ll>pq2;
	for(ll i=0;i<n;i++){
		cin >> a >> b;
		pq.push(a);
		pq2.push(b);
	}
	if(n%2 == 0){
		for(ll i=0;i<n/2-1;i++){
			pq.pop();
			pq2.pop();
		}
		ll d = pq.top();
		pq.pop();
		ll e = pq.top();
		pq.pop();
		d += e;
		d /= 2;
		cout << d << " ";
		d = pq2.top();
		pq2.pop();
		e  =pq2.top();
		d += e;
		d/=2;
		cout << d;
	}
	else{
		for(ll i=0;i<n/2;i++){
			pq.pop();
			pq2.pop();
		}
		cout << pq.top() <<" " <<  pq2.top();
	}
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 296 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 3108 KB Output is correct
2 Correct 62 ms 3128 KB Output is correct
3 Correct 61 ms 3116 KB Output is correct
4 Correct 60 ms 3196 KB Output is correct
5 Correct 59 ms 3228 KB Output is correct
6 Correct 64 ms 3136 KB Output is correct
7 Correct 59 ms 3052 KB Output is correct
8 Correct 73 ms 3128 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 3956 KB Output is correct
2 Correct 98 ms 3904 KB Output is correct
3 Correct 93 ms 3980 KB Output is correct
4 Correct 66 ms 3284 KB Output is correct
5 Correct 89 ms 4000 KB Output is correct
6 Correct 119 ms 4016 KB Output is correct
7 Correct 89 ms 3964 KB Output is correct
8 Correct 91 ms 3972 KB Output is correct