[백준/BOJ] 백준 15459번 : Haybale Feast

https://www.acmicpc.net/problem/15459 15459번: Haybale Feast The first line contains the integers $N$ and $M$, the number of haybales and the minimum total flavor the meal must have, respectively. The next $N$ lines describe the $N$ haybales with two integers per line, first the flavor $F$ and then the spiciness $S$ www.acmicpc.net map을 이용한 투 포인터를 이용해서 문제를 해결했다. 코드 #include #include #include #inc..

2021.08.31