oj.uz

Submission #481702

# Submission time Handle Problem Language Result Execution time Memory
481702 2021-10-21T11:54:56 Z PoPularPlusPlus Best Place (NOI17_bestplace) C++17
100 / 100
 33 ms 1620 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void solve(){
	int n;
	cin >> n;
	int a[n] , b[n];
	for(int i = 0; i < n; i++)cin >> a[i] >> b[i];
	sa(a,n);
	sa(b,n);
	cout << a[n/2] << ' ' << b[n/2] << '\n';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
3.0 / 3.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 204 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 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 1 ms 204 KB Output is correct
6 Correct 1 ms 312 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 972 KB Output is correct
2 Correct 21 ms 1484 KB Output is correct
3 Correct 21 ms 1484 KB Output is correct
4 Correct 16 ms 1612 KB Output is correct
5 Correct 19 ms 1484 KB Output is correct
6 Correct 21 ms 1484 KB Output is correct
7 Correct 21 ms 1600 KB Output is correct
8 Correct 22 ms 1552 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 312 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 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct

Subtask #5
17.0 / 17.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 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 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 31 ms 972 KB Output is correct
2 Correct 32 ms 1612 KB Output is correct
3 Correct 22 ms 1620 KB Output is correct
4 Correct 29 ms 1564 KB Output is correct
5 Correct 33 ms 1484 KB Output is correct
6 Correct 31 ms 1588 KB Output is correct
7 Correct 30 ms 1612 KB Output is correct
8 Correct 33 ms 1484 KB Output is correct