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:
# -*- coding: utf-8 -*-

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]


    token = lines[0].split()
    n = int(token[0])
    a = int(token[1])
    b = int(token[2])

    return (n, a, b)


def solve(n, a, b):

    return min(n*a, b)




def main():
    # 出力

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

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:
n, a, b = (int(i) for i in input().split())

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

Submission status: Accepted

Solution code:
x, y, z = input().split()
N = int(x)
A = int(y)
B = int(z)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

train = n * a
if train > b:
    print(b)
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:
n,a,b = list(map(int,input().split()))

print(min(b,a*n))

Submission status: Accepted

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

print(min(A*N, 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:
# -*- coding: utf-8 -*-
# import itertools

# スペース区切りの整数の入力
n,a,b = map(int, input().split())

train = n * a 

ans = train

if train > b :
    ans = b

# 出力
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, A, B = map(int, str(input()).split())

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

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:
import sys

n, a, b = [ int(x) for x in sys.stdin.readline().split() ]

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

Submission status: Accepted

Solution code:
def TorT(N: int, A: int, B: int)->int:
    return min(A*N, B)


if __name__ == "__main__":
    N, A, B = map(int, input().split())
    ans = TorT(N, A, B)
    print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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())
sume = N * A
print(min(B, sume))

Submission status: Accepted

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


if __name__ == '__main__':
	main()

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:
from sys import stdin

N, A, B = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys;
import string;
sys.setrecursionlimit(20000) # 再起呼び出しの最大数をセット

import copy
import itertools

from functools import lru_cache
#@lru_cache(maxsize = None)

PPP = 1000000007

# 整数の入力
#n = int(input())

# スペース区切りの整数の入力
#a = [int(x) for x in input().split()]
n, a, b = map(int, input().split())
#print("sp", n, k, file=sys.stderr)
#p, q, r = map(int, input().split())
#s = [int(x) for x in input().split()]
#t = [int(x) for x in input().split()]

# 改行区切りの整数の入力
#a = []
#for x in range(n):
#  a.append(int(input()))
#  a.append([int(x) for x in input().split()])
#p = [int(x) for x in input().split()]
#a.sort()
#print(l, file=sys.stderr)

# 文字列の入力
#s = input()

# 出力
#print("{} {}".format(a+b+c, s))
#a.sort()
#print(set(a), file=sys.stderr)
#print(len(set(a)))

#cache = dict()

import re
import fractions

def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)
  
def count(c):
  r = b // c - (a - 1) // c;
  print(c, r, file=sys.stderr)
  return r

def doit():
  res = min(n * a, b)
  
  return res

#print(doit([0] * 4))
#doit(s)
#print(doit())
try:
  print(doit())
except Exception as e:
  print("e", e, file=sys.stderr)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math

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

if A*N<=B:
    print(A*N)
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 = [int(i) for i in input().split()]
train_fee = N*A
if train_fee > B:
    print(B)
else:
    print(train_fee)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

tmp = input().split()
hoge = list(map(lambda a: int(a), tmp))
n=hoge[0]
a=hoge[1]
b=hoge[2]

print(min(n*a,b))

#print(n)
#print(a)
#print(b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 
import math
import sys
import itertools
import numpy as np

# なんこか入力
n,a,b = map(int, input().split())

print(min(b,a*n))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,a,b = [int(i) for i in input().split()]
print(min(a*n,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 = 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())

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

Submission status: Accepted

Solution code:

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


def solve(n, a, b):
    result = min(a * n, b)
    return result


def main():
    n, a, b = input_from_console()
    print(solve(n, a, b))


if __name__ == "__main__":
    import sys

    if sys.gettrace():  # Check if the python interpreter is in debug mode or not.
        check_cases()
    else:
        main()

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:
n, a, b = map(int, input().split())

print(min(a*n,b))

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 = map(int, raw_input().split())

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

Submission status: Accepted

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

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 = 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 a*n <= b:
 print(a*n)
else:
 print(b)

Submission status: Accepted

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

Submission status: Accepted

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

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())
Train=N*A
Taxi=B
print(min([Train,Taxi]))

Submission status: Accepted

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

print(min((s[0]*s[1]),s[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:
N,A,B= map(int,input().split())
NA = N*A
if NA >= B:
    print(B)
else:
    print(NA)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def solv(n, a, b):
    return min(n * a, b)


if __name__ == '__main__':

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

    ans = solv(n, a, b)

    print(ans)

Submission status: Accepted

Solution code:
s = input().rstrip().split(' ')

N = int(s[0])
A = int(s[1])
B = int(s[2])

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(' '))
res1 = n * a
res2 = b
if res1 > res2:
    print(res2)
else:
    print(res1)

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(x) for x in 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(c)
else:
  print(a*b)

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:
N, A, B = map(int, input().split())
print("{}".format(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:
price = list(map(int, input().rstrip().split()))
print(min(price[0]*price[1], price[2]))

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 = [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()]
print(A * N  if (A * N) < B else B)

Submission status: Accepted

Solution code:
from sys import stdin


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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 N*A>B:
  print(B)
else:
  print(N*A)

Submission status: Accepted

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

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:
n , a, b = [ int (i) for i in input().split()]
print( min( a*n , b))

Submission status: Accepted

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

print(min(a * n, b))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

result = min(A*N, B)

print(result)

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 = list(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())

to = a*n

if to < b:
    print(to)

else:
    print(b)

Submission status: Accepted

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


BC133_A()

Submission status: Accepted

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

tr = a * n
tx = b

if tr < tx:
    print(tr)
else:
    print(tx)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#A
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(b)
else:
    print(a*n)

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:
string = input()
split = string.split()
N = int(split[0])
A = int(split[1])
B = int(split[2])


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

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 = map(int, input().split())
print(min(N*A , B))

Submission status: Accepted

Solution code:
from sys import stdin

N, A, B = [int(x) for x in stdin.readline().rstrip().split()]

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

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:
"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

if __name__ == "__main__":
    N,A,B= map(int, sys.stdin.readline().split())
    d=N*A
    t=B
    if d>t:
        ans=t
    else:
        ans=d
    print(ans)

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()))

densha = n*a
takushi = b

print(str(min(densha,takushi)))

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())
if n*a<b:
    print("{}".format(n*a))
else:
    print("{}".format(b))

Submission status: Accepted

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

ans = min(A*N, B)

print(ans)

Submission status: Accepted

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

from fractions import gcd
from math import ceil,floor
import collections

# n=int(input())
# A,B,C,D=map(int, input().split())
# string = input()
# list = list(map(int, input().split()))


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

print(min(N*A,B))

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())


n, a, b = li()

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

Submission status: Accepted

Solution code:
S=input()

tmp=S.split()

N=int(tmp[0])
A=int(tmp[1])
B=int(tmp[2])

print(min(N*A,B))

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:
N, A, B = map(int, input().split())
print(A*N if A*N < B else B)

Submission status: Accepted

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

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:
#coding:utf-8
n, a, b = map(int, input().split())

print(min(a*n, b))

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:
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('{}'.format(min(N*A,B)))

Submission status: Accepted

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

Submission status: Accepted

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

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 N*A < B :
    print(N*A)
else :
    print(B)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 133 abc a
# input
n, a, b = map(int, input().split())
# output
print(min(n*a, b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, A, B = map(int,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())
print(B if N*A > B else N*A)

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:
l=input().split()
N,A,B=int(l[0]),int(l[1]),int(l[2])
if N*A<B:
    s=N*A
else:
    s=B
print(s)

Submission status: Accepted

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

x = a[0]*a[1]

if x>a[2]:
  print(a[2])
else:
  print(x)

Submission status: Accepted

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


if __name__ == '__main__':
  main()

Submission status: Accepted

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

print(min(N*A,B))

Submission status: Accepted

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

print(A*N if N*A < B else 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([b,n*a]))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


train = A * N
taxi = B

if train >= taxi:
    print(taxi)
elif train < taxi:
    print(train)

Submission status: Accepted

Solution code:


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

p = []
p.append(N*A)
p.append(B)

print(min(p))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
 

N, A, B = [int(x) for x in stdin.readline().rstrip().split()]
 
cost = N * A
if cost > B:
    cost = B
    
print(cost)

Submission status: Accepted

Solution code:
import sys

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

train = N * A
taxi = B

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
                                                                                                    
def main():
    input = sys.stdin.readline
    N, A, B = map(int, input().split())
    return min(A*N, B) 
    
     
if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

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:
import sys
input = sys.stdin.readline
n, a, b = map(int, input().split())

print(min(a*n, b))

Submission status: Accepted

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

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 = 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()))
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=list(map(int, input().split()))

a1 = n*a
b1 = b

if a1>=b1:
    out = b1
else:
    out = a1

print(out)

Submission status: Accepted

Solution code:
import sys,heapq
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
def ddprint(x):
  if DBG:
    print(x)

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

Submission status: Accepted

Solution code:
N, A, B = list(map(int, 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())
train = N*A
taxi = B
if train<taxi:
  print(train)
else:
  print(taxi)

Submission status: Accepted

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

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=map(int,input().split())

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

Submission status: Accepted

Solution code:
# 最初に入れておくとinputが早くなる
import sys
input = sys.stdin.readline

# スタック最大数をセット
sys.setrecursionlimit(10**6)

n, a, b = map(int, input().split())
print(min(a*n, 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:
#!/usr/bin/env python
from collections import defaultdict, deque
import math
from math import factorial
import re

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

    price = A_price if A_price < B_price else B_price
    print(price)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np

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

if a_ <= b:
    print(a_)
else:
    print(b)

Submission status: Accepted

Solution code:
import sys
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
ra = lambda: list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
import sys

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

taxi = B/N

if A < taxi:
    ans = A * N
else:
    ans = B

print(ans)

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
print(n * a) if n*a < b 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())
#print(n,a,b)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = map(int, raw_input().split())
print min(a * n, 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())

if N * A < B:
  print(N*A)
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())

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

Submission status: Accepted

Solution code:
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 = list(map(int, input().split()))

print(min(B, A*N))

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())
x = N * A
if x < B:
    ans = x
else:
    ans = B
print(ans)

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(min(N*A, B))

Submission status: Accepted

Solution code:

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

train = A*N
taxi = B

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

Submission status: Accepted

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

t = int(A) * int(N)
d = int(B)
print(min(t,d))

Submission status: Accepted

Solution code:
x, y, z = input().split()

n = int(x)
a = int(y)
b = int(z)

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

Submission status: Accepted

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

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 -*-
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(B, N*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,a,b = map(int, input().split())
print(n*a)if n * a <= b else print(b)

Submission status: Accepted

Solution code:
N, A, B = list(map(int, input().split()))
print(min(A*N,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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(B, A * N))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, a, b = [int(x) for x in input().split()]
if (a * N > b):
    print(b)
else:
    print(a*N)

Submission status: Accepted

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

NAB = input().split(' ')
N = int(NAB[0])
A = int(NAB[1])
B = int(NAB[2])

print(min(B, A * N))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n,a,b = list(map(int,input().split()))
print(min(a*n,b))