Submission #330057

# Submission time Handle Problem Language Result Execution time Memory
330057 2020-11-23T15:17:51 Z johutha Best Place (NOI17_bestplace) C++17
100 / 100
40 ms 3180 KB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;
    vector<int> xs(n);
    vector<int> ys(n);

    for (int i = 0; i < n; i++)
    {
        cin >> xs[i] >> ys[i];
    }
    sort(xs.begin(), xs.end());
    sort(ys.begin(), ys.end());

    cout << xs[n / 2] << " " << ys[n / 2] << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 22 ms 2156 KB Output is correct
2 Correct 30 ms 2284 KB Output is correct
3 Correct 29 ms 2284 KB Output is correct
4 Correct 23 ms 2284 KB Output is correct
5 Correct 28 ms 2284 KB Output is correct
6 Correct 30 ms 2304 KB Output is correct
7 Correct 29 ms 2284 KB Output is correct
8 Correct 29 ms 2284 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 39 ms 3052 KB Output is correct
2 Correct 39 ms 3052 KB Output is correct
3 Correct 28 ms 3052 KB Output is correct
4 Correct 36 ms 2540 KB Output is correct
5 Correct 40 ms 3052 KB Output is correct
6 Correct 40 ms 3052 KB Output is correct
7 Correct 39 ms 3180 KB Output is correct
8 Correct 40 ms 3180 KB Output is correct