Submission #481676

# Submission time Handle Problem Language Result Execution time Memory
481676 2021-10-21T10:19:48 Z Alby14 Best Place (NOI17_bestplace) C++17
100 / 100
31 ms 1184 KB
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main() 
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,center;
    cin>>n;
    int x[n],y[n];
    for(int i=0;i<n;i++)
    {
        cin>>x[i]>>y[i];
    }
    sort(x,x+n);
    sort(y,y+n);
    center=n/2;
    //if(n%2!=0)
    //{
    //   center++;
    //}
    cout<<x[center]<<" "<<y[center];
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 236 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 1092 KB Output is correct
2 Correct 20 ms 972 KB Output is correct
3 Correct 22 ms 1184 KB Output is correct
4 Correct 15 ms 1096 KB Output is correct
5 Correct 19 ms 972 KB Output is correct
6 Correct 20 ms 1088 KB Output is correct
7 Correct 20 ms 972 KB Output is correct
8 Correct 20 ms 1088 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 31 ms 972 KB Output is correct
2 Correct 31 ms 972 KB Output is correct
3 Correct 21 ms 972 KB Output is correct
4 Correct 27 ms 972 KB Output is correct
5 Correct 31 ms 972 KB Output is correct
6 Correct 31 ms 972 KB Output is correct
7 Correct 31 ms 972 KB Output is correct
8 Correct 31 ms 972 KB Output is correct