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)。并且输出的所有数都是整数。
输出:
只输出一个数——问题的答案
样例输入:
7 3
5 10
2 5
3 6
复制
样例输出:
62
复制
样例输入:
3 3
1 3
2 2
3 1
复制
样例输出:
7