[C++] 백준 1085번 직사각형에서 탈출

#include <iostream>
#include <cmath>
using namespace std;

int main() {

	int x, y, w, h;
	cin >> x >> y >> w >> h;

	int newWidth = w - x;
	int newHeight = h - y;

	int arr[4];
	arr[0] = x;
	arr[1] = y;
	arr[2] = newWidth;
	arr[3] = newHeight;

	int min = 1000;

	for (int i = 0; i < 4; i++) {
		if (arr[i] < min) {
			min = arr[i];
		}
	}

	cout << min << endl;

	return 0;
}