题目链接:https://acs.jxnu.edu.cn/problem/CF16B
题目:Burglar and Matches
描述:
A burglar got into a matches warehouse and wants to steal as many matches as possible. In the warehouse there are m containers, in the i-th container there are ai matchboxes, and each matchbox contains bi matches. All the matchboxes are of the same size. The burglar's rucksack can hold n matchboxes exactly. Your task is to find out the maximum amount of matches that a burglar can carry away. He has no time to rearrange matches in the matchboxes, that's why he just chooses not more than n matchboxes so that the total amount of matches in them is maximal.
输入:
The first line of the input contains integer n (1 ≤ n ≤ 2·108) and integer m (1 ≤ m ≤ 20). The i + 1-th line contains a pair of numbers ai and bi (1 ≤ ai ≤ 108, 1 ≤ bi ≤ 10). All the input numbers are integer.
输出:
Output the only number — answer to the problem.
我的翻译:在一个仓库有m个集装箱,每个集装箱里面有ai个火柴盒。现在有一个小偷想要偷火柴,但他只能拿n盒火柴,你的任务就是帮小偷拿到最多的火柴。
输入:第一行n(小偷最多拿n个火柴盒)以及m(有m个集装箱)。接下来有m行,每行有两个数,第一个数表示火柴盒的个数,第二行表示每盒火柴中有多少个火柴。
输出:最多拿几个火柴。