Submission #1059465

#	Time	Username	Problem	Language	Result	Execution time	Memory
1059465		Roumak77	Self Study (JOI22_ho_t2)	Cpython 3	10 / 100	232 ms	55532 KiB

Main

import math

def solve():
    n, m = map(int, input().split())


    list_1 = list(map(int, input().split()))

    list_2 = list(map(int, input().split()))

    curr_max = 0
    curr_min = float('inf')
    for i in range(n):
        curr_max = max(curr_max, max(list_2[i], list_1[i]))
        curr_min = min(max(list_2[i], list_1[i]), curr_min)
    
    print(curr_min)

    

solve()

• Subtask 1: 10 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9