codeforces-919A Supermarket

A. Supermarket
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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 / b yuan 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 .

Examples
Input
Copy
3 5
1 2
3 4
1 3
Output
Copy
1.66666667
Input
Copy
2 1
99 100
98 99
Output
Copy
0.98989899
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.

#include <iostream>
#include <cstring>
#include <iomanip>
using namespace std;
class decimal{
public :
    int up,down;
    decimal(){};
    decimal(int,int);
    friend bool operator>(decimal,decimal);
};
decimal::decimal(int x,int y){
    up=x;
    down=y;
}
bool operator>(decimal x,decimal y){
    return x.up*y.down>x.down*y.up;
}
int main(){
    int n,m;
    while(cin>>n>>m){
        decimal now,minn(101,1);
        for(int i=0;i<n;i++){
            cin>>now.up>>now.down;
            if(minn>now){
                minn=now;
            }
        }
        cout<<fixed<<setprecision(8)<<m*minn.up*1.0/minn.down<<endl;
    }
    return 0;
}

阅读更多
个人分类: Acm
上一篇codeforces 580C Kefa and Park
下一篇codeforces 476C-Dreamoon and Sums
想对作者说点什么? 我来说一句

基于.net+sql2000的supermarket源码

2010年07月09日 1.15MB 下载

supermarket源代码

2012年02月15日 918B 下载

supermarket

2014年06月24日 6.02MB 下载

超市管理系统

2012年06月26日 473KB 下载

控制台版supermarket

2014年12月08日 250KB 下载

CHM文件例子

2011年11月30日 2.18MB 下载

SQL学习总结.docx

2012年12月03日 18KB 下载

PKU 1456 Supermarket 的代码

2008年10月05日 1KB 下载

没有更多推荐了,返回首页

关闭
关闭