[토르] 8주차 과제 제출 #253
Open
[토르] 8주차 과제 제출 #253
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
kth990303
approved these changes
Aug 21, 2022
Comment on lines
+9
to
+14
| A, B, C = map(int, input().split()) | ||
| a_numbers = sorted(list(map(int, input().split()))) | ||
| b_numbers = sorted(list(map(int, input().split()))) | ||
| c_numbers = sorted(list(map(int, input().split()))) | ||
|
|
||
| answer = sys.maxsize |
There was a problem hiding this comment.
정렬한 다음에, 진짜로 모든 부분에 대해 전부 브루트포스하는 게 정해입니다 ㅎㅎ...
단, O(N^3) 풀이는 안됩니다.
최대를 가지는 사람, 최소를 가지는 사람을 고정시켜서 총 3P2가지 경우로 시도해보세요!
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
안녕하세요 이번 주차 문제 뭔가 어렵네요. 한 문제는 풀었는데 나머지 문제들도 계속 도전해보겠습니다.