제출 #420634

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
420634		Berted	Izvanzemaljci (COI21_izvanzemaljci)	C++14	0 / 100	2 ms	204 KiB

izvanzemaljci

#include <iostream>
#include <cassert>

using namespace std;

const int INF = 1e9 + 7;

int N, K;

int main()
{
	cin >> N >> K;
	int mnY = INF, mxY = -INF, mnX = INF, mxX = -INF;
	for (int i = 0; i < N; i++)
	{
		int x, y; cin >> x >> y;
		mnY = min(mnY, y); mxY = max(mxY, y);
		mnX = min(mnX, x); mxX = max(mxX, x);
	}
	cout << mnX << " " << mnY << " " << max(mxX - mnX, mxY - mnY) << "\n";
	return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 21
• Subtask 3: 0 / 12
• Subtask 4: 0 / 30
• Subtask 5: 0 / 32