제출 #1002871

#제출 시각아이디문제언어결과실행 시간메모리
1002871gabistroehIzvanzemaljci (COI21_izvanzemaljci)C++14
5 / 100
51 ms2448 KiB
#include<bits/stdc++.h>
using namespace std;

long long int inf = 3*(1e9 + 10);

long long int maxi(long long int a, long long int b){
	if(a>b) return a;
	else return b;
}

long long int mini(long long int a, long long int b){
	if(a<b) return a;
	else return b;
}

int main(){
	int n, k;
	cin >> n >> k;
	long long int maxx = -inf, maxy = -inf, minx = inf, miny = inf;
	for(int i=0; i<n; i++){
		long long int x, y;
		cin >> x >> y;
		minx = mini(x, minx);
		miny = mini(y, miny);
		maxx = maxi(x, maxx);
		maxy = maxi(y, maxy);
	}

	long long int l = maxi(maxx-minx, maxy-miny);
	if(l==0) l = 1;
	cout << minx << " " << miny << " " << l;
}
#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...