919A. Supermarket

最新推荐文章于 2018-02-21 23:34:49 发布

落凡尘.

最新推荐文章于 2018-02-21 23:34:49 发布

阅读量278

点赞数

分类专栏： ACM日常水题练习集文章标签：暴力

本文链接：https://blog.csdn.net/memory_qianxiao/article/details/79223261

版权

ACM日常水题练习集专栏收录该内容

307 篇文章 20 订阅

订阅专栏

We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don't need to care about what "yuan" is), the same as a / byuan for a kilo.

Now imagine you'd like to buy m kilos of apples. You've asked n supermarkets and got the prices. Find the minimum cost for those apples.

You can assume that there are enough apples in all supermarkets.

Input

The first line contains two positive integers n and m (1 ≤ n ≤ 5 000, 1 ≤ m ≤ 100), denoting that there are n supermarkets and you want to buy m kilos of apples.

The following n lines describe the information of the supermarkets. Each line contains two positive integers a, b (1 ≤ a, b ≤ 100), denoting that in this supermarket, you are supposed to pay a yuan for b kilos of apples.

Output

The only line, denoting the minimum cost for m kilos of apples. Please make sure that the absolute or relative error between your answer and the correct answer won't exceed 10 - 6.

Formally, let your answer be x, and the jury's answer be y. Your answer is considered correct if $\text{[math]}$ .

Note

In the first sample, you are supposed to buy 5 kilos of apples in supermarket 3. The cost is 5 / 3 yuan.

In the second sample, you are supposed to buy 1 kilo of apples in supermarket 2. The cost is 98 / 99 yuan.

寒假工厂里下班回到寝室，玩手机，忘记了今天有比赛了，打开题一看只有40分钟时间了，大佬们基本都最后一题了，看榜他们他们都分分钟钟过前面的题，然而我读题都要话很长时间，幸好有翻译，10多分钟做了,a,b题，果然只能做水题，但是一次性过了，可能是做的晚，就没有被hack,具体通过么，还要看cf最后测试完所有代码和样例。

题意：让你去n个超市卖m千克苹果，给出了n行，每一行a元能买b千克苹果（相当于给出了每千克苹果的价格）。让我们求出花费最少买到m千克的苹果。

题解：暴力我们肯定找出单价价格最低苹果买m千克。算出价格就行，然后找最小的。我估计直接算单价在乘以m估计有精度误差，被cf的坑习惯了，一般最好不要直来直去（直接算那种），被坑哭的人血泪经验告诉你，最好先用价格乘以m在除以b。(所以一看到要算单价，我第一反应知道不能a/b算单价乘以m算出价格，写成a*m/b应该没问题)，果然一次性过了。。

#include<bits/stdc++.h>
using namespace std;
int main()
{
     double n,m,a,b,ans;
     while(cin>>n>>m)
     {  ans=1<<30;
         for(int i=0;i<n;i++)
         {
             cin>>a>>b;
             ans=min(ans,a*m/b);
         }
        printf("%.10lf\n",ans);
     }
    return 0;