Skip to content

leekc3813/algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

Algorithm

소스코드 블록은 다음과 같이 작성할 수 있습니다.

n = int(input())

a=list(map(int,input().split()))
b=list(map(int,input().split()))

s = 0

for i in range(n):
  s += min(a) * max(b)
  a.pop(a.index(min(a)))
  b.pop(b.index(max(b)))

print(s)

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages