본문 바로가기
HackerRank Algorithm

[HackerRank] 06. Min and Max

by KIha_Jung 2020. 3. 9.

import numpy as np

np.printoptions()
my_arr = []
N, M = input().split()
for _ in range(int(N)):
    my_arr.append(list(map(int, input().split())))

my_arr = np.array(my_arr)
print(np.max(np.min(my_arr, axis=1)))

'HackerRank Algorithm' 카테고리의 다른 글

[HackerRank] 08. Mean, Var and Std  (0) 2020.03.09
[HackerRank] 07. Migratory Birds  (0) 2020.03.09
[HackerRank] 05. Mini-Max Sum  (0) 2020.03.09
[HackerRank] 04. Nested List  (0) 2020.03.09
[HackerRank] 03. Sock Merchant  (0) 2020.03.09

댓글