英文原题:题目来源:
https://acs.jxnu.edu.cn/contest/22/board/challenge/A
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个箱子在第i个箱子里面有ai个火彩盒并且这一部分火彩盒里面有bi根火柴。所有的火彩盒都是相同的款式。小偷的背包里恰好可以放n个火彩盒。你的任务是计算出小偷最多可以带走的火柴数量,因为他没有时间重新放置火柴盒里面的火柴,所以只能够拿不超过n个火柴盒,因此是拿走数量最多的。
输入:
第一行输入整数n(1<=n<=2·108)和m(1 ≤ m ≤ 20).
第i+1行输入ai 和 bi (1 ≤ ai ≤ 108, 1 ≤ bi ≤ 10)
所有的输入都是整数
输出:
输出一个整数——这个问题的答案。