[python] 백준 1059 좋은 구간 (실패)

www.acmicpc.net/problem/1059

1059번: 좋은 구간

s = int(input())
l = list(map(int, input().split()))
n = int(input())

l.sort()
mn, mx = 0, 0
for i in l:
    if i < n:
        mn = i
    if i == n:
        result = 0
        break
    if n < i and mn != 0:
        mx = i
        break
        
print(mn, mx)

if mn == 0 and mx == 0:
    if max(l) < n:
        result = max(l)-n
    if min(l) > n:
        result = min(l)-n
else:
    result = 0
    for i in range(mn+1, n+1):
        for j in range(n, mx):
            # print(i,j)
            result += 1
        
if result == 0:
    print(result)
else:
    print(result-1)