[20250913] BOJ / G4 / 팀 빌딩 / 이준희 #881
Merged
Conversation
This file contains hidden or 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
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.
🧷 문제 링크
https://www.acmicpc.net/problem/22945
🧭 풀이 시간
25분
👀 체감 난이도
✏️ 문제 설명
프로그래머 팀의 능력치는배열 내 두 프로그래머 사이의 프로그래머 수 * 두 프로그래머의 능력치 중 작은값 일 때
구할 수 있는 능력치의 최댓값을 출력하는 문제입니다.
🔍 풀이 방법
왼쪽 오른쪽 끝부터 투포인터를 사용해서
작은쪽을 움직이면서 풀었습니다.
⏳ 회고
투포인터라는 것을 떠올리면 쉬운 것 같습니다