Problem:


Score : 100 points

Problem Statement

N of us are going on a trip, by train or taxi.

The train will cost each of us A yen (the currency of Japan).

The taxi will cost us a total of B yen.

How much is our minimum total travel expense?

Constraints

All values in input are integers.

1 \leq N \leq 20

1 \leq A \leq 50

1 \leq B \leq 50

Input

Input is given from Standard Input in the following format:

N A B

Output

Print an integer representing the minimum total travel expense.

Sample Input 1

4 2 9

Sample Output 1

8

The train will cost us 4 \times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.

Sample Input 2

4 2 7

Sample Output 2

7

Sample Input 3

4 2 8

Sample Output 3

8



Sample input:
4 2 9


Sample output:
8

Submission status: Accepted

Solution code:
N,A,B= map(int,input().rstrip().split(' '))
n = A*N
if n >= B:
    print(B)
else:
    print(n)

Submission status: Accepted

Solution code:
# coding:utf-8

line = input()
ls = line.split(" ")
n = int(ls[0])
a = int(ls[1])
b = int(ls[2])

print(b) if n * a >= b else print(n * a)

Submission status: Accepted

Solution code:
N,A,B=map(int, input().split())

Train=A*N
Taxi=B

ans=min(Train,Taxi)
print(ans)

Submission status: Accepted

Solution code:
n, a, b = list(map(int, input().split()))
print(min(n*a, b))

Submission status: Accepted

Solution code:
n, a, b = list(map(int, input().strip().split()))

print(min(n*a, b))

Submission status: Accepted

Solution code:
import numpy as np
N,A,B=map(int,input().split())
if N*A > B:
  print(B)
else:
  print(N*A)

Submission status: Accepted

Solution code:
N, A, B = raw_input().split(' ')
 
print(min(int(A) * int(N), int(B)))

Submission status: Accepted

Solution code:
n, a,b = map(int, input().split())
print(min(n*a, b))

Submission status: Accepted

Solution code:
N,A,B=list(map(int,input().split()))

elec=A*N
taxi=B

if  elec<taxi:
 print(elec)
else:
 print(taxi)

Submission status: Accepted

Solution code:
s = input()
l = s.split(" ")

n = int(l[0])
a = int(l[1])
b = int(l[2])
#print(l)
train = n * a
taxi = b

if(taxi < train):
    print(taxi)
else:
    print(train)

Submission status: Accepted

Solution code:

N,A,B=map(int,(input().split()))

print(min(N*A,B))

Submission status: Accepted

Solution code:
# A
N, A, B = map(int,  input().split())
if N*A < B:
    print(N*A)
else:
    print(B)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())

if (A * N < B):
    print(A * N)
else:
    print(B)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())
T = N * A

L = [T, B]
print(min(L))

Submission status: Accepted

Solution code:
n, a, b = map(int,input().split())

if n*a < b:
    print(n*a)
else:
    print(b)

Submission status: Accepted

Solution code:
N, A, B = list(map(int, input().split()))
 
total_cost = N * A
 
if total_cost > B:
  total_cost = B
  
print(total_cost)

Submission status: Accepted

Solution code:
people, train, taxi = input().split()
price1 = int(people) * int(train)
print(min(price1, int(taxi)))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    
    n, a, b = map(int, input().split())
    print(min(n*a, b))

Submission status: Accepted

Solution code:
arg = input().split()

by_train = int(arg[0]) * int(arg[1])
by_taxi = int(arg[2])

if by_train > by_taxi:
  print(by_taxi)
else:
  print(by_train)

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))

if i[0] * i[1] <= i[2]:
    print(i[0] * i[1])
else:
    print(i[2])

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
if n * a < b:
    print(n * a)
else:
    print(b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math

n,a,b = [int(c) for c in input().split(' ')]

print(min(a*n,b))

Submission status: Accepted

Solution code:
# スペース区切りの文字列の入力（別変数に格納）
n,a,b = map(int, input().split())
den=a*n
taxi=b
if den<taxi:
    print(den)
else:
    print(taxi)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))

bus = a[0] * a[1]
taxi = a[2]

min = bus if bus < taxi else taxi

print(min)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split(" "))
if A*N<B:
    print(A*N)
else:
    print(B)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

input = sys.stdin.readline

def main():
    N, A, B = map(int, input().split())
    print(min(N*A, B))

main()

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())

print(min(a*n, b))

Submission status: Accepted

Solution code:
i = input()
tmp = i.split(' ')
N = int(tmp[0])
A = int(tmp[1])
B = int(tmp[2])

dm = N * A
tm = B

if tm < dm:
    print(tm)
else:
    print(dm)

Submission status: Accepted

Solution code:
n,a,b = input().split()
n = int(n)
a = int(a)
b = int(b)

c_a = n*a
if c_a<b:
  	print(c_a)
else:
  	print(b)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n, a, b = map(int, input().split())
print(min(a * n, b))

Submission status: Accepted

Solution code:

(N,A,B) = (int(i) for i in input().split(" "))

print(min(N*A,B))

Submission status: Accepted

Solution code:
n,a,b = list(map(int, input().split()))
print(min([n*a, b]))

Submission status: Accepted

Solution code:
N,A,B = map(int,input().split())

train = N*A
taxi = B

print(min(train,taxi))

Submission status: Accepted

Solution code:
n,a,b = map(int,input().split())
ans = min(a*n,b)
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n, a, b = [int(x) for x in input().split()]
print(min(n * a, b))

Submission status: Accepted

Solution code:
N, A, B = list(map(int, input().split()))
print(min(A*N, B))

Submission status: Accepted

Solution code:
i=input()
ii = i.split()
if int(ii[0]) * int(ii[1]) < int(ii[2]):
  print(int(ii[0]) * int(ii[1]))
else:
  print(int(ii[2]))

Submission status: Accepted

Solution code:
N, A, B = list(map(int, input().split()))

tac = N * A
train = B

if tac < train:
    print(tac)

else:
    print(train)

Submission status: Accepted

Solution code:
N,A,B=map(int,input().split())
if A*N>B:
	print(B)
else:
	print(A*N)

Submission status: Accepted

Solution code:
a = input()
b = a.split()
if (int(b[0])*int(b[1]))>=int(b[2]):
    print(int(b[2]))
else:
    print(int(b[0])*int(b[1]))

Submission status: Accepted

Solution code:
N , A , B = map(int,input().split())

a =  A * N


if a < B:
    print(a)
else:
    print(B)

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline

N, A, B = map(int, readline().split())

print(min(N * A, B))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# coding: utf-8

import sys
import math
def myinput_int():
    return list(map(int, input().split()))

N,A,B = myinput_int()

if N*A < B :
	print(N*A)
else :
	print(B)

Submission status: Accepted

Solution code:
def main(N,A,B):
  print(min(N*A,B))

if __name__ == '__main__':
  N,A,B = map(int,input().split())
  main(N,A,B)

Submission status: Accepted

Solution code:
N,A,B = map(int,input().split())
if N*A <= B:
  print (N*A)
else:
  print (B)

Submission status: Accepted

Solution code:
N, A, B = (int(i) for i in input().split())

print(min(N*A,B))

Submission status: Accepted

Solution code:
n, a, b = [int(v) for v in input().split()]
print(min(n * a, b))

Submission status: Accepted

Solution code:
n, a, b = (int(c) for c in input().split())

a = n * a

if a < b:
    print(a)

if a >= b:
    print(b)

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
train = n * a
taxi = b
l = [train, taxi]
print(min(l))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from collections.abc import Iterable
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
    from math import gcd
except Exception:
    from fractions import gcd


def solve(N: int, A: int, B: int):
    return min(N * A , B)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    result = solve(N, A, B)
    if isinstance(result, Iterable) and not isinstance(result, str):
        result = '\n'.join([str(v) for v in result])
    print(result)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N,A,B = map(int, input().split())
train = N * A

if train <= B:
  print(train)
else:
  print(B)

Submission status: Accepted

Solution code:
n,a,b=map(int,input().split())
A=n*a
if A>=b :
  print(b)
else :
  print(A)

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
if n*a < b:
	print (n*a)
else: 
	print (b)

Submission status: Accepted

Solution code:
n = [int(i) for i in input().split()]
print(min([n[1]*n[0], n[2]]))

Submission status: Accepted

Solution code:
n,a,b = map(int,input().split())
print(min((n*a),b))

Submission status: Accepted

Solution code:
s=input()
#s = ("4 2 9")
#print(s) 
s = s.split(" ")


densya = int(s[0])*int(s[1])
taxi   = int( s[2] )

if ( densya < taxi):
    print(densya)
else:
    print(taxi)

Submission status: Accepted

Solution code:
N, A, B = (int(x) for x in input().split())

if(N*A < B):
    ans = N*A
else:
    ans = B

print(ans)

Submission status: Accepted

Solution code:
n, a, b = (int(i) for i in input().split())  
train = n*a
taxi = b
if train >= taxi:
  print(taxi)
else:
  print(train)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())
if A*N < B:
  print(A*N)
else:
  print(B)

Submission status: Accepted

Solution code:
n,a,b=map(int,input().split())

if n * a >= b:
    print(b)
else:
    print(n * a)

Submission status: Accepted

Solution code:
N, A, B= map(int, input().split())
print(min(A*N, B))

Submission status: Accepted

Solution code:
inputData = input().split()

if int(inputData[0]) * int(inputData[1]) < int(inputData[2]):
  print(str(int(inputData[0]) * int(inputData[1])))
else:
  print(inputData[2])

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
de = a*n
ans = 0
if b >= de :
    ans = de
else:
    ans = b
print(ans)

Submission status: Accepted

Solution code:
N,A,B=map(int,input().split())
if (A*N)<=B:
    print(A*N)
else:
    print(B)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())
if N*A>B:
  print(B)
else:
  print(N*A)

Submission status: Accepted

Solution code:
N, A, B= list(map(int, input().split()))
print('{}'.format(N*A if N*A < B else B))

Submission status: Accepted

Solution code:
def acinput():
    return list(map(int, input().split(" ")))


N,A,B=acinput()


d=N*A
Tx=B
if d<Tx:
    print(d)
else:
    print(Tx)

Submission status: Accepted

Solution code:
# 2つの入力を空白で分割し、数値化
N, A, B = map(int, input().split())
print(min(N * A, B))

Submission status: Accepted

Solution code:
n, a, b = list(map(int, input().split()))
print(min(a * n, b))

Submission status: Accepted

Solution code:
from collections import defaultdict

def main():
    n, a, b = map(int, input().split())
    print(min(b, a * n))







if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
data = sys.stdin.readlines()
data_0 = data[0].split()
data_int = [int(a) for a in data_0]

print(min(data_int[0] * data_int[1], data_int[2]))

Submission status: Accepted

Solution code:
n,a,b = map(int, input().split())
 
if n * a > b:
    print(b)
else:
    print(n * a)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a*b<c:
  print(a*b)
else:
  print(c)

Submission status: Accepted

Solution code:
line = input()

N, A, B = map(int, line.split(' '))

if N*A > B: print(B)
else: print(N*A)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())
if N*A >= B:
  print(B)
else:
  print(A*N)

Submission status: Accepted

Solution code:
N, A, B = (int(i) for i in input().split())

trainCost = N * A
taxiCost = B

if trainCost < taxiCost:
    print(trainCost)
else:
    print(taxiCost)

Submission status: Accepted

Solution code:
n,a,b = (int(i) for i in input().split())

train = a*n
taxy  = b

print(min([train, taxy]))

Submission status: Accepted

Solution code:
N, A, B = [int(i) for i in input().split()]

train = N*A
taxi = B
ans = min([train,taxi])
print(ans)

Submission status: Accepted

Solution code:
n,a,b = map(int,input().split())	
if n*a<=b:
  print(int(n*a))
else:
  print(b)

Submission status: Accepted

Solution code:
n, A, B = map(int, input().split())
print(n*A if n*A < B else B)

Submission status: Accepted

Solution code:
inputs = [int(i) for i in input().split(" ")]

sum1 = inputs[0] * inputs[1]
if sum1 < inputs[2]:
    print(sum1)
else:
    print(inputs[2])

Submission status: Accepted

Solution code:
n,a,b=map(int,input().split())
taxi=b
bus=n*a
if taxi>bus:
    print(bus)
else:
    print(taxi)

Submission status: Accepted

Solution code:
n, a, b = (int(i) for i in input().split())  



train = n * a
taxy = b

print(min(train, taxy))

Submission status: Accepted

Solution code:
N,A,B =list(map(int,input().split()))
train=N*A
if train <B:
    print(train)
else:
    print(B)

Submission status: Accepted

Solution code:
N, A, B = input().split()

N = int(N)
A = int(A)
B = int(B)

if N * A < B:
    print(N*A)
else:
    print(B)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())


print(min(N*A, B))

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
if a*n < b:
	print(a*n)
else:
	print(b)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())

a = N * A

if a > B:
    print(B)
else:
    print(int(a))

Submission status: Accepted

Solution code:
def resolve():
    n,a,b=map(int,input().split())
    print(min(n*a,b))
resolve()

Submission status: Accepted

Solution code:
def inpl():
    return list(map(int, input().split()))


N, A, B = inpl()
print(min(N*A, B))

Submission status: Accepted

Solution code:
N, A, B = input().split()
N = int(N)
A = int(A)
B = int(B)
tr = A*N
cost = min(tr,B)
print(cost)

Submission status: Accepted

Solution code:
n,a,b = map(int,input().split())

print(min(n*a,b))

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n, a, b = readmi()
print(min(n * a, b))

Submission status: Accepted

Solution code:
input_data=input().split()
ninzu = int(input_data[0])
densya = int(input_data[1])
taxi= int(input_data[2])


densya_tin = densya * ninzu

print(min(densya_tin,taxi))

Submission status: Accepted

Solution code:
N, A, B = list(map(int, input().split()))

if N * A >= B:
    print(B)
else:
    print(N * A)

Submission status: Accepted

Solution code:
n,a,b = map(int, input().split())

if n*a >= b:
  ans = b
else:
  ans = n*a
print(ans)

Submission status: Accepted

Solution code:
s = list(map(int, input().strip().split(' ')))

a = s[0] * s[1]
b = s[2]

if a < b:
    print(a)
else:
    print(b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys


def answer(N, A, B):
    rail = N * A
    taxi = B

    print(min(rail, taxi))


if __name__ == '__main__':
    args = sys.stdin.read().split(' ')
    answer(int(args[0]), int(args[1]), int(args[2]))

Submission status: Accepted

Solution code:
N, A, B = (input().split())

Electric_train = int(N) * int(A)

b = int(B)

if b > Electric_train:
    print(Electric_train)
else:
    print(b)

Submission status: Accepted

Solution code:
import bisect
import sys

verbose = False


def main():
    rv = 0
    input = sys.stdin
    args = input.readline()
    argv = args.split()
    iargv = [int(arg) for arg in argv]
    ans = min(iargv[1] * iargv[0], iargv[2])
    print(ans)


if __name__ == '__main__':
    main()
    # mock()

Submission status: Accepted

Solution code:
N,A,B=map(int,input().split())
#print(N,A,B)
print(min(B,A*N))

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))

N,A,B = LI()

print(min(N*A, B))

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
# import bisect
# import math
# import numpy as np
# from fractions import gcd

"""Template"""


class IP:
    """
    入力を取得するクラス
    """
    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        # 参考
        # https://blog.rossywhite.com/2018/08/06/bit-search/
        # https://atcoder.jp/contests/abc105/submissions/4088632
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    # output.append(a[j])
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x//y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)

    def lcm(self, x, y):
        return (x * y) // self.gcd(x, y)


"""ここからメインコード"""


def main():
    # 1文字に省略
    r, e = range, enumerate
    ip = IP()
    id = Idea()

    """この下から書いてね"""
    n, a, b = ip.IL()
    if n * a >= b:
        print(b)
    else:
        print(n*a)


main()

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
print(b if b <= n*a else n*a)

Submission status: Accepted

Solution code:
n,a,b = map(int,input().split())

if n*a > b:
    print(b)
    
else:
    print(n*a)

Submission status: Accepted

Solution code:
n,a,b=map(int,input().split())
if a*n>=b:
  print(b)
else:
  print(a*n)

Submission status: Accepted

Solution code:
from sys import stdin



def main():
    N,A,B = [int(x) for x in stdin.readline().split()]
    
    if N*A<B:
        print(N * A)
    else:
        print(B)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if A * B <= C:
    print(A * B)
else:
    print(C)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())

if N*A<B:
    print(N*A)
else:
    print(B)

Submission status: Accepted

Solution code:
N,A,B = [int(i) for i in input().split()]
C=N*A
print(min(C,B))

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    x = list(map(int, input().split()))
    if x[0]*x[1] < x[2]:
        print(x[0]*x[1])
    else:
        print(x[2])

Submission status: Accepted

Solution code:
n,a,b = map(int, input().split())

ans = min(n * a,b)
print(ans)

Submission status: Accepted

Solution code:
n,a,b= map(int, input().split())
if(a * n < b):
    print(a*n)
else:
    print(b)

Submission status: Accepted

Solution code:
N, A,B = [int(x) for x in input().split()]
print(min(N*A, B ))

Submission status: Accepted

Solution code:
n,a,b = [int(i) for i in input().split()]
if n*a<b:
    print(n*a)
else:
    print(b)

Submission status: Accepted

Solution code:
n,a,b=map(int,input().split())

d=a*n
if d>b:
    print(b)
else:
    print(d)

Submission status: Accepted

Solution code:
l = input().split(" ")
n = int(l[0])
a = int(l[1])
b = int(l[2])
if n * a < b:
    print(n * a)
else:
    print(b)

Submission status: Accepted

Solution code:
n = [int(x) for x in input().split()]
n2 = n[0] * n[1]

if n[0] * n[1] >= n[2]:
  print(n[2])

else:
  print(n2)

Submission status: Accepted

Solution code:
N, A, B = map(int,input().split())

if N * A <= B:
    print(N * A)
else:
    print(B)

Submission status: Accepted

Solution code:
N, Train, Taxi = map(int, input().split(" "))

if N*Train > Taxi:
  print(Taxi)
else:
  print(N*Train)

Submission status: Accepted

Solution code:
import copy
import sys
from bisect import bisect_left, bisect_right
from collections import ChainMap, Counter, deque, defaultdict, namedtuple
from fractions import gcd
from heapq import heappop, heappush
from itertools import accumulate
from math import ceil, floor
from operator import itemgetter

# sys.setrecursionlimit(10**6)


def main():
    n, a, b = [int(x) for x in input().split(' ')]

    ans = min(n * a, b)

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
input_arr = [int(x) for x in input().split()]

N = input_arr[0]
A = input_arr[1]
B = input_arr[2]

train = N*A
taxi = B

if train > taxi:
    print(taxi)
else:
    print(train)

Submission status: Accepted

Solution code:
from enum import Enum
from queue import Queue
import collections

import sys
import math

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001

N,A,B = map(int,input().split())
min=0
if N*A < B:
    min = N*A
else:
    min = B

print(min)

Submission status: Accepted

Solution code:
n,a,b=map(int,input().split())

print(min(a*n,b))

Submission status: Accepted

Solution code:
n, a, b=map(int, input().split())
res=min(n*a,b)
print(res)

Submission status: Accepted

Solution code:
def calc(n: int, a: int, b: int) -> int:
    train_prise = n * a
    return min(train_prise, b)


n, a, b = [int(v) for v in input().split(" ")]
print(calc(n, a, b))

Submission status: Accepted

Solution code:
import sys

str = input().split()
  
train = int(str[0]) * int(str[1])
tax = int(str[2])

if train < tax:
  print(train)
else:
  print(tax)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())

R = min(N * A, B)

print(R)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a*b >= c:
  print(c)
elif a*b == c:
  print(c)
else:
  print(a*b)

Submission status: Accepted

Solution code:
n=list(map(int,input().split()))
if n[0] * n[1] >= n[2]:
  print(n[2])
else :
  print(n[0] * n[1])

Submission status: Accepted

Solution code:
str = input().split()
N = int(str[0])
A = int(str[1])
B = int(str[2])

if N * A < B:
    print(N * A)
else:
    print(B)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split(' '))
price = []
res = B if B <= A *N else A*N
print(res)

Submission status: Accepted

Solution code:
A = [int(x) for x in input().split()]
if A[0]*A[1] <= A[2]:
  print(A[0]*A[1])
else:
  print(A[2])

Submission status: Accepted

Solution code:
N, A, B = map(int, input().strip().split())

print(min(N * A, B))

Submission status: Accepted

Solution code:
import sys
import random
input = sys.stdin.readline

################################################################################

n, a, b = map(int, input().split())
print(min(n*a, b))

Submission status: Accepted

Solution code:
N, A, B = (int(i) for i in input().split())
if (N * A) >= B:
  print(B)
else:
  print(N * A)

Submission status: Accepted

Solution code:
s = list(map(int, input().split()))

f_train = s[0]*s[1]
f_taxi = s[2]

if f_train <= f_taxi:
    print(f_train)
else:
    print(f_taxi)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

sum = a*b
if(sum<c):
    ans = sum
else:
    ans = c
print(ans)

Submission status: Accepted

Solution code:
m,a,b=map(int, input().split())

if m*a > b:
    print(b)
else:
    print(m*a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

N, A, B = list(map(int, input().split()))
if N * A < B:
    print(N * A)
else:
    print(B)

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
if a*n <= b:
    print(a*n)
else:
    print(b)

Submission status: Accepted

Solution code:
# coding: utf-8

N, A, B = list(map(int, input().split()))

print(min(N*A, B))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n, a, b = map(int, input().split())

print(min(b, a*n))

Submission status: Accepted

Solution code:
n, a, b = (int(x) for x in input().split())

train = a * n

if train >= b:
    print(b)
else:
    print(train)

Submission status: Accepted

Solution code:
N,A,B = (int(i) for i in input().split()) 
print(min(N*A,B))

Submission status: Accepted

Solution code:
arr = [int(i) for i in input().split()]

N = arr[0]
A = arr[1]
B = arr[2]

train = N * A
taxi = B

print(min(train,taxi))

Submission status: Accepted

Solution code:
n,a,b = map(int,input().split())

train = n*a
tax = b

if train > tax:
	print(tax)
	exit()
print(train)

Submission status: Accepted

Solution code:
N, a, b = map(int, input().split())

if a*N<b:
    print(a*N)
else:
    print(b)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n, a, b = LI()
    print(min(n * a, b))
    return

#B
def B():
    n, d = LI()
    x = LIR(n)
    a = list(itertools.combinations(range(n), 2))
    ans = 0
    for a1,a2 in a:
        b = 0
        for bi in range(d):
            b += (x[a1][bi] - x[a2][bi])** 2
        if float.is_integer(math.sqrt(b)):
            ans += 1
    print(ans)
    return

#C
def C():
    l, r = LI()
    if l // 2019 == r // 2019:
        print((l * (l + 1)) % 2019)
    else:
        print(0)
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
num = list(map(int,input().split()))
x = num[0]*num[1]
y = num[2]
nums = [x,y]
print(min(nums))

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())

print(min(a*n, b))

Submission status: Accepted

Solution code:
str=input()
str=str.split()
N=[int(i) for i in str]

B=N[0]*N[1]
if B>=N[2]:
    print(N[2])
else:
    print(B)

Submission status: Accepted

Solution code:


def read_input():
    n, a, b = map(int, input().split())
    return n, a, b


def submit():
    n, a, b = read_input()

    if b < n * a:
        print(b)
    else:
        print(n * a)


if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
n,a,b = map(int,input().split())

if( n * a >= b ):
    print(b)
else:
    print(n * a);

Submission status: Accepted

Solution code:
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
s=n*a
if s<b:
	print(s)
else:
  print(b)

Submission status: Accepted

Solution code:
N, A, B = (int(i) for i in input().split())
cost = N * A if N * A < B else B
print(cost)

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
x = a[0] * a[1]
y = a[2]

if (x<y):
  print(x)
else:
  print(y)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())

if N * A > B:
    print(B)
else:
    print(N*A)

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())

total = min([a * n, b])

print(total)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())
ans = min(A*N, B)
print(ans)

Submission status: Accepted

Solution code:
N, A, B = map(int, input().split())
w_1 = N * A
w_2 = B
a = min(w_1, w_2)
print(a)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

N, A, B = map(int, input().split())

train = A*N
car   = B
if train < car:
    print(A*N)
else:
    print(car)

Submission status: Accepted

Solution code:
N,a,b = map(int,input().split())

s = N * a

if s < b:
    print(s)
else:
    print(b)

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split(' '))

print(min(n * a, b))