# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464285 | 2021-08-12T17:41:43 Z | vendx_greyback | Best Place (NOI17_bestplace) | C++14 | 47 ms | 3832 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define all(x) (x).begin(),(x).end() int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n,i; cin>>n; vector<int> x(n),y(n); for(int i = 0; i<n; i++) cin>>x[i]>>y[i]; sort(all(x)); sort(all(y)); int temp = (n-1)/2; cout<<x[temp]<<' '<<y[temp]; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 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 | 1 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 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 | 320 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 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 2904 KB | Output is correct |
2 | Correct | 30 ms | 3032 KB | Output is correct |
3 | Correct | 29 ms | 3020 KB | Output is correct |
4 | Correct | 24 ms | 3068 KB | Output is correct |
5 | Correct | 28 ms | 3012 KB | Output is correct |
6 | Correct | 29 ms | 3020 KB | Output is correct |
7 | Correct | 30 ms | 2904 KB | Output is correct |
8 | Correct | 30 ms | 3036 KB | Output is correct |
# | 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 | 1 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 316 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
7 | Correct | 1 ms | 312 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 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 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 44 ms | 3808 KB | Output is correct |
2 | Correct | 42 ms | 3788 KB | Output is correct |
3 | Correct | 35 ms | 3788 KB | Output is correct |
4 | Correct | 38 ms | 3040 KB | Output is correct |
5 | Correct | 41 ms | 3808 KB | Output is correct |
6 | Correct | 47 ms | 3832 KB | Output is correct |
7 | Correct | 41 ms | 3800 KB | Output is correct |
8 | Correct | 42 ms | 3800 KB | Output is correct |