【CUGBACM14级BC第34场 A】hdu 5190 Go to movies

Go to movies

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

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≤n,m≤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 ai,bi(1≤ai,bi≤100 )   , indicating the choices of the group buying cinemas offered which means you can use bi yuan to buy ai 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.
   
   
   
    
  
  

 

题意：给你n个学生和m个电影院，每个电影院可以用b元买a张票

问你哪个电影院可以话最少元买到n个学生的票，输出价钱

思路：水题，直接模拟

#include<bits/stdc++.h>
#include <ctime>
using namespace std;
typedef long long ll;
const int MAXN = 1 * 1e9;
const ll M = 1e9 + 7;

int main()
{
    ///clock_t start_time = clock();

    ///clock_t end_time = clock();
    ///cout << "Running time is: " << static_cast<double>(end_time - start_time) / CLOCKS_PER_SEC * 1000 << "ms" << endl;
    std::ios::sync_with_stdio(false);
    int n, m;
    while (cin >> n >> m)
    {
        int ans = MAXN, a, b, cost;
        while (m--)
        {
            cin >> a >> b;
            cost = n / a;
            if (n % a)
            {
                cost++;
            }
            ans = min(ans, cost * b);
        }
        cout << ans << endl;
    }
    return 0;
}