/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 15ms 3.02 MiB
#2 Accepted 16ms 2.883 MiB
#3 Accepted 16ms 3.109 MiB
#4 Accepted 15ms 2.98 MiB
#5 Accepted 15ms 3.117 MiB
#6 Accepted 15ms 3.082 MiB

Code

m = map(int, input().split())
n = list(m)

if n[0] > n[1]:
	max1 = n[0]
	min1 = n[1]
else:
	max1 = n[1]
	min1 = n[0]

if n[2] > n[3]:
	max2 = n[2]
	min2 = n[3]
else:
	max2 = n[3]
	min2 = n[2]
	
if max1 > max2:
	lar = max1
else:
	lar = max2
	
if min1 < min2:
	low = min1
else:
	low = min2
	
print(low)
print(lar)

Information

Submit By
Type
Submission
Problem
P1022 Minmax
Contest
Brain booster - 1
Language
Python 3 (Python 3.12.3)
Submit At
2023-12-31 13:48:14
Judged At
2024-10-03 14:06:30
Judged By
Score
100
Total Time
16ms
Peak Memory
3.117 MiB