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. (这个仓库里有m个容器,在第i个容器里有ai柴火盒子,每个火柴盒子里有bi个火柴)
The burglar's rucksack can hold n matchboxes exactly. (窃贼背包最多装n个火柴盒子)
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.(他没有事件去重新排序这些火柴,那就是为什么选择不超过n火柴盒子,以至于达到最大数量。)
输入:
The first line of the input contains integer n (1 ≤ n ≤ 2·108) and integer m (1 ≤ m ≤ 20).
(第一行输入包含整数 n和整数 m)
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.(第i行包括一对数字 ai 和 bi 。输入的数字都是整数)
输出:
Output the only number — answer to the problem.
(输出只有一个数字—答案)