Submission #956264

# Submission time Handle Problem Language Result Execution time Memory
956264 2024-04-01T12:32:10 Z Github Best Place (NOI17_bestplace) C++17
3 / 100
30 ms 3164 KB
#include <iostream>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
using namespace std;

#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
const long long mod = 1e9+7;
#define ll long long


int main() {
    speedup
    int n; cin >> n;
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++){
        cin >> x[i] >> y[i];
    }
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    if (n%2 == 1){
        cout << x[(n+1)/2] << ' ' << y[(n+1)/2] << endl;
    }else{
        cout << (x[n/2-1]+x[n/2])/2 << ' ' << (y[n/2-1]+y[n/2])/2 << endl;
    }
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 14 ms 2140 KB Output is correct
2 Correct 22 ms 2396 KB Output is correct
3 Incorrect 19 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 28 ms 3164 KB Output is correct
2 Incorrect 30 ms 3164 KB Output isn't correct
3 Halted 0 ms 0 KB -