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().split(" "))

print(min(a * n, b))

Submission status: Accepted

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

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

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([a*n, b]))

Submission status: Accepted

Solution code:
lis_base = list(map(int,input().split()))
N = lis_base[0]
A = lis_base[1]
B = lis_base[2]

print(min(A*N,B))

Submission status: Accepted

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

d = A * B
t = B

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

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

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

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

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

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

Submission status: Accepted

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

print(min(n*a,b))

Submission status: Accepted

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


def solve(N: int, A: int, B: int):
    if N * A < B:
        print(N * A)
    else:
        print(B)
    return


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
    solve(N, A, 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())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

x = N*A
y = B

print(min(x, y))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def p_a():
    N, A, B = map(int, input().split())
    print(min(N * A, B))
    
p_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 = 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())
train = a*n
taxi = b
print(min(train,taxi))

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
n, a, b = [int(i) for i in sys.stdin.readline().split()]
print(min(a * n, 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())
train = N*A
taxi = B
print(min(train,taxi))

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

tr = n *a
if b >= tr:
    print(tr)
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())
train = N * A
taxi = B
ans = min(train, taxi)
print(ans)

Submission status: Accepted

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

print(min(N*A, B))

Submission status: Accepted

Solution code:
s =[int(x) for x in input().split()]
print(min(s[0]*s[1], s[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(i) for i in 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:
    print(x)
else:
    print(B)

Submission status: Accepted

Solution code:
i,j,k=map(int,input().split())
if i*j<=k:
  print(i*j)
else:
  print(k)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print( min(N*A, B) )

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
N=(n[0])
A=(n[1])
B=(n[2])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
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 a*n > b:
  print(b)
else:
  print(a*n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
li = list(map(int,stdin.readline().rstrip().split()))
if li[1]*li[0] > li[2]:
    print(li[2])
else:
    print(li[0]*li[1])

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

Submission status: Accepted

Solution code:
n,m,l = input().split()
n = int(n)
m = int(m)
l = int(l)

print(min(n*m,l))

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

Submission status: Accepted

Solution code:
# -*- coding:utf8 -*-

n,a,b = map(int,input().split())
t = a*n
ans = t if t <= b else b
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())
train=N*A
taxi=B
if train<=taxi:
    print(train)
else: print(taxi)

Submission status: Accepted

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

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 = (int(x) for x in 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( b if b < a*N else a*N)

Submission status: Accepted

Solution code:
array = input().split()
array = tuple(array)

count = int(array[0])
train_fare = int(array[1])
taxi_fare = int(array[2])

total_train_fare = train_fare * count


if (total_train_fare <= taxi_fare):
    print(total_train_fare)
else:
    print(taxi_fare)

Submission status: Accepted

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

N *= A

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

Submission status: Accepted

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

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:
from sys import exit, stderr, stdin
input = stdin.readline
def debug(var, name="hoge"):
    print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
    return


def main():
    N,A, B = [int(n) for n in input().split()]
    print(min(A*N, B))
    # N = int(input())
    # a = [int(input()) for _ in range(N)]
    # S = str(input())[:-1]
    # print(S)
    # L = len(S)
    # INF = 10000000002
    # EPS = 1e-9
    # exit()



if __name__ == "__main__":
    main()

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
 
n, a, b = [int(x) for x in stdin.readline().rstrip().split()]
print(min(a*n, 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:
ns = input().split(" ")
if int(ns[0])*int(ns[1]) <= int(ns[2]):
  print(int(ns[0])*int(ns[1]))
else:
  print(int(ns[2]))

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())) # N人で旅行

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

Submission status: Accepted

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

print(min(int(N*A),B))

Submission status: Accepted

Solution code:
import sys
from math import ceil
from operator import itemgetter as get

def input():
    return sys.stdin.readline().strip()

def iinput():
    return int(input())

def finput():
    return float(input())

def tinput():
    return input().split()

def rinput():
    return map(int, tinput())

def rlinput():
    return list(rinput())

def nod(a, b):
    while b: 
        a, b = b, a % b
    return a
 
def calc(n, c, d):
    return n - n // c - n // d + n // (c * d // nod(c, d))   


def main():
    n, a, b = rinput()
    print(min(a * n, b))
main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n, a, b = list(map(int, input().rstrip('\n').split()))
    print(min(a * n, b))


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

print(min(b, n*a))

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


# 初項s, 交差dのn個の数列の和
def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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

print(min(a*n, b))

Submission status: Accepted

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

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

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:
import sys
input = sys.stdin.readline
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())

ans = min(A*N, B)

print(ans)

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

Submission status: Accepted

Solution code:
n,a,b=input().split(" ")
cost=[]
cost.append(int(n)*int(a))
cost.append(int(b))
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())

t = n * a

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

Submission status: Accepted

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

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(a) for a in input().split())
if N*A>B:
    print(B)
else:
    print(A*N)

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

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:
    sum=B

else:
    sum=N*A

print(sum)

Submission status: Accepted

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

if __name__ == "__main__":
    f_a()

Submission status: Accepted

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

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

Submission status: Accepted

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

train = A*N

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

Submission status: Accepted

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

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

Submission status: Accepted

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

w1 = a*n

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

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

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

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

Submission status: Accepted

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

d = n * a
t = b

ans = min([d,t])
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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

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

else:
    print(A * N)

Submission status: Accepted

Solution code:
l = map(int, raw_input().split())

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
readints=lambda:map(int,input().split(' '))
n,a,b=readints()
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 = map(int, input().split())
if 1 <= n <= 20 and 1 <= a <= 50 and 1 <= b <= 50:
    print(min(n * a, b))
else:
    print('Invalid value')

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(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(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(taxi)
else:
    print(train)

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

Submission status: Accepted

Solution code:


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

print(min(b,a*n))

Submission status: Accepted

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


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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

    return min(N*A, B)

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

Submission status: Accepted

Solution code:
#AtCoder Beginner Contest 133 A問題
a=list(map(int, input().split()))
N=a[0]
A=a[1]
B=a[2]

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

Submission status: Accepted

Solution code:
input_data = input().split(" ")

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
inp = [int(v) for v in input().split(' ')]
N = inp[0]
A = inp[1]
B = inp[2]

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

# print(N)
# print(A)
# print(B)

# print(N * A)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print (min(a*b, c))

Submission status: Accepted

Solution code:
N,A,B= map(int, input().split())
#n, a, b = map(int, input().split())

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

Submission status: Accepted

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


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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
    solve(N, A, B)

if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

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

train = n * a
taxi = b

expense = [train,taxi]

print(min(expense))

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

Submission status: Accepted

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

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

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:
# input N, A, B
N,A,B = (int(x) for x in input().split())
# compare A*N and B
if A*N > B:
    print(B)
else:
    print(int(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:
N,A,B=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())
print(min(b,a*n))

Submission status: Accepted

Solution code:
List = list(map(int,input().split()))
N = List[0]
A = List[1]
B = List[2]

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

Submission status: Accepted

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

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)