CF16B.Burglar and Matches
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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.
输入输出样例
输入#1
7 3 5 10 2 5 3 6
输出#1
62
输入#2
3 3 1 3 2 2 3 1
输出#2
7