# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466129 | Nanogines | Best Place (NOI17_bestplace) | C++14 | 43 ms | 3140 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define forn(i, a, b) for (int i=a; i<b; i++)
#define fore(i, a, b) for (int i=a; i<=b; i++)
typedef vector<int> vi;
void fast_io() {
fastio;
}
signed main()
{
fast_io();
int n;
cin >> n;
int c, d;
vi a(n), b(n);
forn (i, 0, n) cin >> a[i] >> b[i];
sort(a.begin(), a.end());
sort(b.begin(), b.end());
cout << a[(n - 1) / 2] << " " << b[(n - 1) / 2] << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |