BOJ : 1085 직사각형에서 탈출

문제 : https://www.acmicpc.net/problem/1085

github : https://github.com/JEONG-SEUNGWOOK/BOJ/blob/master/1085.cpp

#include <cstdio>
#include <algorithm>
using namespace std;

int main(){
    int x,y,w,h;
    scanf("%d %d %d %d",&x, &y, &w, &h);
    int m=1001;
    m = min(min(x-0, w-x), min(y-0, h-y));
    printf("%d",m);
    return 0;
}