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円

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

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

Tr = N * A
Tx = B
print(min(Tr,Tx))

Submission status: Accepted

Solution code:
a = []
a = input().split()

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

cost = 0

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

Submission status: Accepted

Solution code:

n = input()

N = int(n.split()[0])
A = int(n.split()[1])
B = int(n.split()[2])

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

else:
    print(int(A*N))

Submission status: Accepted

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

Submission status: Accepted

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

def func(people_num, train_fee, cab_fee):
    train = people_num*train_fee
    print(min(train, cab_fee))
    pass


def main():
    n, a, b = [int(i) for i in input().split()] 
    func(n,a,b)
    
# main関数呼び出し
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

input = input().split()
a = int(input[0])
b = int(input[1])
c = int(input[2])

ans = 0
if a * b > c:
    ans = c
else:
    ans = a*b

print(ans)

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


if __name__ == "__main__":
    test()

Submission status: Accepted

Solution code:
i = list(map(int,input().split()))
n = i[0] * i[1]

if n - i[2] <=0:
    print (n)
else:
    print(i[2])

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

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

Submission status: Accepted

Solution code:
IN=input()
num=IN.split(" ")
N,A,B=[int(s) for s in num]

cost=[]
costA=N*A
costB=B

cost=[costA,costB]

print(min(cost))

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

ans = min(N*A,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=map(int,input().split())
taxi=b/n

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

Submission status: Accepted

Solution code:
#A
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(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())

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

Submission status: Accepted

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

if Train <= B:
    print(Train)
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:
R = lambda:map(int,input().split())
n,a,b = R()
print(min(n*a,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:
n,a,b=map(int, input().split())
res=min([n*a, b])
print(res)

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(B)
elif 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(n*a)

Submission status: Accepted

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

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

A = A * N

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

Submission status: Accepted

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

list=[int(n) for n in list]

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

Submission status: Accepted

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


if __name__ == "__main__":
    print(solve())

Submission status: Accepted

Solution code:
#n = int(input())
#a = list(map(int, input().split()))
n,a,b = map(int, 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())
     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= (int(i) for i in input().split())  
train = N*A
if train < B:
	print(train)
else:
	print(B)

Submission status: Accepted

Solution code:
# A - T or T

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

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

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 = list(map(int,input().split()))
if n[0]*n[1] < n[2]:
	print(n[0]*n[1])
else:
	print(n[2])

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())
sum1 = n*a
ans = min(sum1,b)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A = list(map(int,input().split()))
ans = A[0]*A[1]

if A[0]*A[1] > A[2]:
	ans = A[2]

print(ans)

Submission status: Accepted

Solution code:
# import numpy as np
# import copy

def main():
    n,a,b = input().split(' ')
    n = int(n)
    a = int(a)
    b = int(b)

    ag = a*n

    print(min(ag,b))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if b > n * a:
    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:
n,a,b = map(int,raw_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(B)
else:
  print(A*N)

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())
print(min(a * b, c))

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

Submission status: Accepted

Solution code:
import math

#n = int(input())
n, a, b= [int(i) for i in input().split()]
#table = [[int(i) for i in input().split()] for j in range(n)]
#table = [list(input()) for n in range(h)]
#list = [int(i) for i in input().split()]
#num = [int(i) for i in range(n)]
#s = [input() for i in range(n)]
#s = input()
#list = list(s)
#temp = [[0 for _ in range(13)] for _ in range(13)]

print(min(b,a*n))

Submission status: Accepted

Solution code:
N, A, B = map(int, input().rstrip().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(n*a if n*a<b else b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print((lambda x:x[0]*x[1]<x[2]and x[0]*x[1]or x[2])([int(i)for i in input().split(' ')]))

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())
train = N*A
taxi = B
result = train - taxi

if result >= 0:
    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:
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())

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

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

Submission status: Accepted

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

a *= n

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,S,T=map(int,input().split())
Ssum = N*S
if Ssum > T:
  print(int(T))
else :
  print(Ssum)

Submission status: Accepted

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

tak = int(a) * int(b)
rail = int(c)

if tak < rail: 
	print( "%d" % tak )
else :
  	print( "%d" % rail )

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def taxi_or_train(N, A, B):
    return min(N*A, B)

if __name__ == "__main__":
    N, A, B = map(int, input().split(' '))
    print(taxi_or_train(N, A, 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:
n,a,b=(int(x) for x in input().split())
train=int(n*a)
taxi=(b)
print(min(train,taxi))

Submission status: Accepted

Solution code:
str = input("")
n, a, b = str.split(' ')

fare_taxy = int(b)
fare_bus = int(a) * int(n)

if fare_taxy < fare_bus:
    print(fare_taxy)
else:
    print(fare_bus)

Submission status: Accepted

Solution code:
n, train_price, taxi_price = map(int, input().split())
train_price = train_price * n

min_price = min([train_price, taxi_price])

print(min_price)

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)=(int(x)for x in input().split())

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

Submission status: Accepted

Solution code:
NAB =  list(map(int,input().split()))
n = NAB[0]
a = NAB[1]
b = NAB[2]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,A,B = input().split()
ans = min (int(N)*int(A),int(B))
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:
a,b,c = map(int,input().split())
d = a*b
if d>c:
	print(c)
else:
	print(d)

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc133/tasks/abc133_a
# A - T or T

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

# N, A, B = [4,2,9]

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

Submission status: Accepted

Solution code:
import sys
def main():
    input = sys.stdin.readline
    NAB = list(map(int, input().split()))
    N = NAB[0]
    A = NAB[1]
    B = NAB[2]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
inp = input().split(" ")
n = int(inp[0])
a = int(inp[1])
b = int(inp[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nab = [int(i) for i in input().split()]
n = nab[0]
a = nab[1]
b = nab[2]

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

Submission status: Accepted

Solution code:
people , train, taxi = [int(i) for i in input().split()]
train_fee = train * people
if train_fee <= taxi:
	print(train_fee)
else:
  print(taxi)

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

Submission status: Accepted

Solution code:
N,A,B = list(map(int, input().split()))
ans = N*A
if ans > B:
    ans = B
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:
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())
pa = n*a
pb = b
print(min(pa,pb))

Submission status: Accepted

Solution code:
from copy import *
from sys import *
import math
import queue
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)

#dp[i][j]: iまでからj枚えらんで和がkになるのは何通り
def main():
	n,a,b =  map(int,input().split())
	print(b if b < a*n else a*n)

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(m,n):
	x = max(m,n)
	y = min(m,n)
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	return y

class queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

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

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

Submission status: Accepted

Solution code:
n, a, b = input().strip().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:
from sys import stdin
N, A, B = [int(_) for _ in stdin.readline().rstrip().split()]
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 = [int(zz) for zz 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 = map(int,input().split())
D  = A*N
if D>B:
    print(B)
else: 
    print(D)

Submission status: Accepted

Solution code:
i = input().split(" ")
people = int(i[0])
train_fee = int(i[1])
taxi_fee = int(i[2])

train_sum = people * train_fee
if train_sum > taxi_fee:
    print(taxi_fee)
else:
    print(train_sum)

Submission status: Accepted

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

train = int(n) * int(a)
taxi = int(b) // int(n)

if train < int(b):
    print(train)
else:
    print(b)

Submission status: Accepted

Solution code:
S = input()

S = S.split()

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


train_cost = N*A
taxi_cost  = B

if train_cost >= taxi_cost:
    print(taxi_cost)
else:
    print(train_cost)

Submission status: Accepted

Solution code:
# スペース区切り整数の入力
N, A, B = map(int, input().split())

# 最小の合計交通費を出力
print("{}".format(min([N * A, B])))

Submission status: Accepted

Solution code:
import numpy as np

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
if (train < b):
    print(train)
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 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 = (int(i) for i 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(b)
else:
    print(n*a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def A_TorT():
    N, A, B = map(int,input().split())
    total = B
    if A < (B / N):
        total = A * N
    print(total)

if __name__ == "__main__":
    A_TorT()

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

Submission status: Accepted

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

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:
S = input().split()

N = int(S[0])
cost_train = int(S[1]) * N
cost_taxi  = int(S[2])

if cost_train > cost_taxi:
    print(cost_taxi)
else:
    print(cost_train)

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

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:
n,A,B = input().split()
a = int(n) * int(A)
b = int(B)
if a < b:
  print(a)
else:
  print(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:
#!/usr/bin/env python

def main():
    N, A, B = list(map(int, input().strip().split()))
    if N * A < B:
        return N * A
    else:
        return B

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
from sys import stdin

readline = stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if A * N > B:
    print("{}".format(B))
else:
    print("{}".format(N*A))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
import math
mod = 10**9 + 7
def I(): return int(input())
def II(): return map(int, input().split())
def L(): return list(map(int, input().split()))
def TWO(M):
  L=[0]*M
  R=[0]*M
  for i in range(M):
    L[i],R[i] = II()
  return L, R

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

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

Submission status: Accepted

Solution code:
#coding : utf-8

import os, sys

N, A, B = map(lambda x: int(x), input().split(" "))

print(min(A * N, B))

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())
print(min(b,a*n))

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 -*-


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

tmp = A * N
if tmp < B:
  print(tmp)
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:
#!/usr/bin/env python

A, B, C = list(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())
print(b) if n * a > b else print(n * a)

Submission status: Accepted

Solution code:
def main(n,a,b):
    if (1 <= n <= 20 )and (1 <= a <= 50) and (1 <= b <= 50) :
        sum_list = [n * a, b] 
    return min(sum_list)

if __name__ == '__main__':
    s = list(map(int, input().split()))
    huga = main(s[0],s[1],s[2])
    print(huga)