현대_Softeer_level2_GBC_파이썬_230720

미칠거 같다 오랜만에 코테 준비.....

 

가즈아!!!!

 

 

import sys
 
first_line = input()
N = int(first_line.split()[0])
M = int(first_line.split()[1])
 
N_meter = []
N_speed = []
M_meter = []
M_speed = []
 
for i in range(N):
    now_line = input().split()
    N_meter.append(int(now_line[0]))
    N_speed.append(int(now_line[1]))
for i in range(M):
    now_line = input().split()
    M_meter.append(int(now_line[0]))
    M_speed.append(int(now_line[1]))
 
def pick_m(a,b):
    if a>b:
        return a-b, 0, 1
    elif a<b:
        return a-b, 1, 0
    else:
        return 0, 1, 1
 
def pick_s(a,b,now_max):
    if a<b:
        if now_max<b-a:
            return b-a
        else:
            return now_max
    else:
        return now_max
 
n_case = 0
max_over = 0
rest_meter = 0
m_case = 0
while n_case<len(M_meter) and m_case < len(M_meter):
    rest_meter,n_plus,m_plus = pick_m(N_meter[n_case],M_meter[m_case])
    if rest_meter>0:
        N_meter[n_case] = rest_meter
    elif rest_meter<0:
        M_meter[m_case] = -rest_meter
    max_over = pick_s(N_speed[n_case], M_speed[m_case],max_over)
    n_case+=n_plus
    m_case+=m_plus
    
print(max_over)

Be positive!

Be rich!

Live your life!