📌BOJ 알고리즘 트레이닝
[BOJ][백준] 그리디 알고리즘-10590번: Burrito King
https://www.acmicpc.net/problem/10590 10590번: Burrito King The first line contains three integers \(n\), \(A\), and \(B\) (1 ≤ \(n\) ≤ 100 000, 0 ≤ \(A\), \(B\) ≤ 109), the number of ingredients, the least amount of Albert’s joy and the maximal amount of Barney’s unhappiness. Each of the following \(n\) lines cont www.acmicpc.net 입력 The first line contains three integers n, A, and B (1 ≤ n ≤ 100..
