https://acs.jxnu.edu.cn/contest/22/board/challenge/A
描述:
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.
一个盗贼进入了一个火柴仓库并且尽可能多的偷一些火柴。火柴仓库里有m个容器,在第i个容器有ai个火柴盒,并且每个火柴盒包含bi根火柴。所有的火柴和都一样大。盗贼的背包能装n盒火柴。你的任务是找到盗贼能带走的最大火柴数。他没有时间对包里的火柴重排,那就是为什么她不能选择超过n盒火柴来让火柴数最大的原因。
输入:
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.
第一行输入一个整数n和一个整数m。第i+1行包含一对数字ai和bi。所有输入的数字是整数。
输出:
Output the only number — answer to the problem.
输出一个数字 问题的答案