[python] 1085 직사각형에서 탈출

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

1085번: 직사각형에서 탈출

 

배열에 넣어서 sort

while 1:
  alist = list(map(int,input().split()))
  flag =True;
  for i in alist:
    if type(i) is not int:
      flag = False
      break;
      
  if(flag == False):
    continue
  if (1<=alist[2] and alist[2]<=1000):
    w=alist[2]
  else:
    print("잘못된 정수입력")
    continue
  if (1<=alist[3] and alist[3]<=1000):
    h=alist[3]
  else:
    print("잘못된 정수입력")
    continue
  if (1<=alist[0] and alist[0]<=alist[2]):
    x=alist[0]
  else:
    print("잘못된 정수입력")
    continue
  if (1<=alist[1] and alist[1]<=alist[3]):
    y=alist[1]
  else:
    print("잘못된 정수입력")
    continue
  break
  

blist=[]

blist.append(w-x)
blist.append(x)
blist.append(h-y)
blist.append(y)
blist.sort()

#print(blist)
print(blist[0])

 

min함수

조건 안걸어도 맞았다고 나오네요

x, y, w, h = map(int, input().split())
print(min(x, y, w-x, h-y))