题目:
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.
样例输入:
7 3 5 10 2 5 3 6
复制
样例输出:
62
复制
样例输入:
3 3 1 3 2 2 3 1
复制
样例输出:
7
翻译:
描述:
一个小偷进入了一个火柴仓库,想偷走尽可能多的火柴,在仓库里有m个集装箱,在第i个集装箱里有ai个火柴盒,并且每个火柴盒里有bi根火柴。
所有的火柴盒大小相同,这个小偷的帆布背包可以装n盒火柴,你的任务是找出小偷可以带走的最多数量的火柴,他没有时间再次管理火柴盒中的火柴,他仅仅选择不超过n盒火柴的原因是他想使火柴的数量达到最多。
输入:
第一行输入包含一个整数n(1<=n<=2*10 8)和整数m(1<=m<=20).第i+1行包含一对数ai和bi(1<ai<10 8,1<=bi<=10),所有的输入数据是整数。
输出:
输出唯一一个数--问题的答案。