919A - Supermarket - CodeForces Solution

brute force greedy implementation *800

Please click on ads to support us..

Python Code: 

n,m=map(int,input().split())
a,b=map(int,input().split())
mn=a/b*m
for i in range(n-1):
    a,b=map(int,input().split())
    c=a/b*m
    if(c<mn):
        mn=c
print(mn)

C++ Code: 

#include <bits/stdc++.h>
using namespace std;
int main ()
{
    int n,m; cin >> n >> m;
    double kilo = 0x3f3f3f3f;
    int a, b;
    for (int i = 0; i < n; i++)
    {
        cin >> a >> b;
        kilo = min (kilo , (double)a/b);
    }
    printf ("%.8f",kilo*m);
    return 0;
}


Comments

Submit
0 Comments
More Questions

13 Reasons Why
Friend's Relationship
Health of a person
Divisibility
A. Movement
Numbers in a matrix
Sequences
Split houses
Divisible
Three primes
Coprimes
Cost of balloons
One String No Trouble
Help Jarvis!
Lift queries
Goki and his breakup
Ali and Helping innocent people
Book of Potion making
Duration
Birthday Party
e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division