제출 #414485

#제출 시각아이디문제언어결과실행 시간메모리
414485medmdgIzvanzemaljci (COI21_izvanzemaljci)C++14
0 / 100
2 ms300 KiB
#include <bits/stdc++.h>
#define ll  long long
#define endl    "\n"
using namespace std;
const ll M=1000000009;
struct pt{
    ll x,y;    
};
int main() {
    ll n,k;
    cin>>n>>k;
    pt a[n];
    ll lx=M,ly=M,hx=-M,hy=-M;
    for(int i=0;i<n;i++){
        cin>>a[i].x>>a[i].y;
        hx=max(hx,a[i].x);
        hy=max(hy,a[i].y);
        ly=min(ly,a[i].y);
        lx=min(lx,a[i].x);
    }
    if(k<3){
        if(k==1){
            cout<<lx<<" "<<ly<<" "<<max(hx-lx,hy-ly)<<endl;
            return 0;
        }
        /*cout<<lx<<" "<<ly<<" "<<min(hx-lx,hy-ly)<<endl;
        if(hx-lx==)*/
    }

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...