Submission #738178

# Submission time Handle Problem Language Result Execution time Memory
738178 2023-05-08T08:43:35 Z Ronin13 Best Place (NOI17_bestplace) C++14
100 / 100
38 ms 1432 KB
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;
const int nmax = 200001;


int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    vector <int> x, y;
    for(int i = 1; i <= n; i++){
        int X, Y; cin >> X >> Y;
        x.pb(X);
        y.pb(Y);
    }
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    cout << x[n / 2] << ' ' << y[n / 2];
}
# 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 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 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 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 18 ms 1324 KB Output is correct
2 Correct 22 ms 1232 KB Output is correct
3 Correct 22 ms 1232 KB Output is correct
4 Correct 17 ms 1232 KB Output is correct
5 Correct 19 ms 1336 KB Output is correct
6 Correct 21 ms 1336 KB Output is correct
7 Correct 23 ms 1432 KB Output is correct
8 Correct 22 ms 1384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 38 ms 1312 KB Output is correct
2 Correct 33 ms 1316 KB Output is correct
3 Correct 22 ms 1232 KB Output is correct
4 Correct 29 ms 1232 KB Output is correct
5 Correct 32 ms 1292 KB Output is correct
6 Correct 32 ms 1252 KB Output is correct
7 Correct 31 ms 1296 KB Output is correct
8 Correct 35 ms 1392 KB Output is correct