[백준] 8980번 - 택배 (파이썬)
# 택배 import sys input = sys.stdin.readline N, W = map(int, input().split()) box_num = int(input()) box_info = [] for _ in range(box_num): start, end, num = map(int, input().split()) box_info.append((start, end, num)) box_info.sort(key=lambda x: (x[1])) result = 0 arr = [W for _ in range(N+1)] for x, y, num in box_info: num = min(num, min(arr[x:y])) if num != 0: for i in range(x, y): arr[i] -= nu..
2022. 5. 13.
[백준] 24041번 - 성싶당 밀키트 (파이썬)
# 성싶당 밀키트 import sys from collections import defaultdict input = sys.stdin.readline N, G, K = map(int, input().split()) info = defaultdict(list) for _ in range(N): speed, limit, isImportant = map(int, input().split()) info[isImportant].append((speed, limit)) def get_g(x, k): result = 0 for speed, limit in info[0]: result += speed*max(1, x-limit) info[1].sort(key=lambda k: -k[0]*max(1, x-k[1])) f..
2022. 4. 15.
[프로그래머스] Lv1 - 최소직사각형 (파이썬)
https://programmers.co.kr/learn/courses/30/lessons/86491 코딩테스트 연습 - 최소직사각형 [[10, 7], [12, 3], [8, 15], [14, 7], [5, 15]] 120 [[14, 4], [19, 6], [6, 16], [18, 7], [7, 11]] 133 programmers.co.kr def solution(sizes): x, y = 0, 0 for t in sizes: t.sort() x = max(x, t[0]) y = max(y, t[1]) return x*y 그리디 1. 각 사이즈들을 정렬한다. 2. 각 width, height 별로 max값을 찾는다 3. 넓이 반환
2022. 3. 19.
