Submission #693315

# Submission time Handle Problem Language Result Execution time Memory
693315 2023-02-02T17:12:07 Z varun312 Best Place (NOI17_bestplace) C++14
100 / 100
37 ms 3056 KB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

#define pb push_back
#define pf push_front
#define fi first
#define se second


int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n;
    cin >> n;
    vector<int> x(n);
    vector<int> y(n); 
    for (int i = 0; i < n; i++)
    {
        cin >> x[i] >> y[i];
    }

    sort(x.begin(), x.end());
    sort(y.begin(), y.end());

    cout << x[n/2] << " " << y[n/2] << endl;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 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 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 2192 KB Output is correct
2 Correct 23 ms 2260 KB Output is correct
3 Correct 28 ms 2268 KB Output is correct
4 Correct 16 ms 2252 KB Output is correct
5 Correct 19 ms 2260 KB Output is correct
6 Correct 24 ms 2244 KB Output is correct
7 Correct 22 ms 2124 KB Output is correct
8 Correct 21 ms 2252 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 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 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 34 ms 3028 KB Output is correct
2 Correct 37 ms 3024 KB Output is correct
3 Correct 23 ms 3056 KB Output is correct
4 Correct 29 ms 2244 KB Output is correct
5 Correct 33 ms 3004 KB Output is correct
6 Correct 31 ms 3012 KB Output is correct
7 Correct 33 ms 3028 KB Output is correct
8 Correct 32 ms 3012 KB Output is correct