F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Go to movies

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1288    Accepted Submission(s): 715


Problem Description
Winter holiday is coming!As the monitor, LeLe plans to go to the movies.
Because the winter holiday tickets are pretty expensive, LeLe decideds to try group-buying.
 

Input
There are multiple test cases, about $20$ cases. The first line of input contains two integers $n,m(1 \leq n,m \leq 100)$. $n$ indicates the number of the students. $m$ indicates how many cinemas have offered group-buying.

For the $m$ lines,each line contains two integers $a_i,b_i(1 \leq ai,bi \leq 100)$, indicating the choices of the group buying cinemas offered which means you can use $b_i$ yuan to buy $a_i$ tickets in this cinema.
 

Output
For each case, please help LeLe **choose a cinema** which costs the least money. Output the total money LeLe should pay.
 

Sample Input
3 2 2 2 3 5
 

Sample Output
4
 

Hint
LeLe can buy four tickets with four yuan in cinema 1.
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-05-12 09:47:19, Gzip enabled