Submission #862150

# Submission time Handle Problem Language Result Execution time Memory
862150 2023-10-17T14:47:23 Z varun312 Best Place (NOI17_bestplace) C++17
100 / 100
29 ms 3164 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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 15 ms 2140 KB Output is correct
2 Correct 19 ms 2392 KB Output is correct
3 Correct 19 ms 2392 KB Output is correct
4 Correct 14 ms 2396 KB Output is correct
5 Correct 17 ms 2648 KB Output is correct
6 Correct 19 ms 2396 KB Output is correct
7 Correct 19 ms 2140 KB Output is correct
8 Correct 19 ms 2388 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 480 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 29 ms 3164 KB Output is correct
2 Correct 27 ms 3032 KB Output is correct
3 Correct 18 ms 3160 KB Output is correct
4 Correct 25 ms 2648 KB Output is correct
5 Correct 28 ms 3164 KB Output is correct
6 Correct 27 ms 3164 KB Output is correct
7 Correct 27 ms 3164 KB Output is correct
8 Correct 27 ms 3152 KB Output is correct