이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
const ll MOD=1e9+7;
using namespace std;
map <ll,bool> x;
map <ll,bool> y;
ll N;
vector <ll> vec1;
vector <ll> vec2;
int main(){
cin>>N;
for(int i=1;i<=N;i++){
ll a,b;
cin>>a>>b;
vec1.push_back(a);
vec2.push_back(b);
}
sort(vec1.begin(),vec1.end());
sort(vec2.begin(),vec2.end());
ll s1=vec1.size();
ll s2=vec2.size();
cout<<vec1[s1/2]<<' '<<vec2[s2/2]<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |