넘치게 채우기

https://www.acmicpc.net/problem/9910BOJ - Progress문제 유형: 수학, 다이나믹 프로그래밍, 브루트 포스문제 난이도: Silver I시간 제한: 2초메모리 제한: 1024MB 문제An arithmetic progression is an ascending sequence a of n numbers a1   such that the difference of two consecutive elements is always the same.  Example: The sequence 11 Given is an ascending sequence c of k numbers c1  Example: Let c be the sequence 1 You can assume that the ..

https://leetcode.com/problems/take-gifts-from-the-richest-pile/description/leetcode - Take Gifts From the Richest Pile문제 유형: 우선순위 큐문제 난이도: Easy 문제You are given an integer array gifts denoting the number of gifts in various piles. Every second, you do the following:Choose the pile with the maximum number of gifts.If there is more than one pile with the maximum number of gifts, choose any.Leave be..