Skip to content

[23-09-01] BOJ 1106 #199

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
cyjadela wants to merge 2 commits into
base: main
Choose a base branch
from
Open

[23-09-01] BOJ 1106 #199

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
724fd8a
[BOJ] 1107
cyjadela Sep 1, 2023
78c92b8
[BOJ] 1107 -> 1106
cyjadela Sep 1, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 18 additions & 0 deletions yoonjin/0901/1106.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
import sys
input = sys.stdin.readline

c, n = map(int, input().split())
cost_list = []

for i in range(n):
cost, people = map(int, input().split())
cost_list.append([cost, people])

dp = [1e7 for _ in range(c+100)] #최댓값이 100
dp[0] = 0

for cost, people in cost_list:
for i in range(people, c+100):
dp[i] = min(dp[i-people]+cost,dp[i])

print(min(dp[c:]))