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())
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 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=map(int,input().split())
s=n*a
ans=min(s,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:
# AtCoder Beginner Contest 133
# A T or T

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



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

Submission status: Accepted

Solution code:
from sys import stdin
n, a, b = map(int, stdin.readline().split())
if n * a < b:
    print(n * a)
else:
    print(b)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys, math, itertools, bisect, copy, re
from collections import Counter, deque, defaultdict

# from itertools import accumulate, permutations, combinations, takewhile, compress, cycle
# from functools import reduce
# from math import ceil, floor, log10, log2, factorial
# from pprint import pprint

INF = float('inf')
MOD = 10 ** 9 + 7
EPS = 10 ** -7
sys.setrecursionlimit(1000000)

# N = int(input())
# N,M = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]
# A = [int(input()) for _ in range(N)]
# DP = [[0] * 100 for _ in range(100)]
# DP = defaultdict(lambda: float('inf'))

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

train=a*n
tax=b

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

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input.txt')

#+++++

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(a*b, c))

Submission status: Accepted

Solution code:
n, train, taxi = map(int, input().split(' '))
if n * train <= taxi:
  print(int(n*train))
else:
  print(int(taxi))

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:
l = [int(x) for x in raw_input().split()]
print min(l[0] * l[1], l[2])

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main01():
    data = input().split()
    num = []

    for i in range(3):
        num.append(int(data[i]))
    densya = num[0] * num[1]
    if densya > num[2]:
        print(num[2])
    else:
        print(densya)


if __name__ == "__main__":
    main01()

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=input().split()
a=int(s[0])
b=int(s[1])
c=int(s[2])
if(a*b<=c):
  print(a*b)
else:
  print(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:
# a.py
n,a,b = map(int,input().split())
print(min(n*a,b))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

n = list[0]
a = list[1]
b = list[2]

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
import re
from collections import deque
import sys
input = sys.stdin.readline


def int_raw():
    return int(input())


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


def ints_raw():
    return tuple(map(int, ss_raw()))


DIV = 10**9+7


def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def ncr(n, r, mod=DIV):
	r = min(r, n-r)
	ret = 1
	for i in range(1, r+1):
		ret = ret * (n-i+1) % mod
		ret = ret * mod_inv(i, mod) % mod
	return ret


def main():
    N,A,B = ints_raw()
    c1 = N*A
    c2 = B
    return min(c1,c2)

print(main())

Submission status: Accepted

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

if A*N<B:
    ans=A*N
else:
    ans=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:
# -*- coding utf-8 -*-
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:
get = input().split()
N = int(get[0])
A = int(get[1])
B = int(get[2])
train = A * N
if train <= B:
    print(train)
else:
    print(B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, A, B = [int(i) for i in input().split()]
#train
sum_train = N*A
#tax
sum_tax = B

if sum_train < sum_tax:
    print(sum_train)
else:
    print(sum_tax)

Submission status: Accepted

Solution code:
import sys
a,b,c=map(int,sys.stdin.readline().split())
print(min(a*b,c))

Submission status: Accepted

Solution code:
s = []
s = input().split(' ')

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

Submission status: Accepted

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

print(min(N * A, B))

Submission status: Accepted

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

def func(n, a, b):
  if (n*a > b):
    print(b)
  else:
    print(n*a)
    
func(A[0], A[1], A[2])

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

Submission status: Accepted

Solution code:
N,A,B=(int(x) for x in 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(A*N,B))

Submission status: Accepted

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

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

print(min(N * A, B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N,A,B = [int(zz) for zz in input().split()]
i = N*A
if i <= B:
    print(i)
elif i >= B:
    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 = A * N
Taxi = B

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

Submission status: Accepted

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

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

li = [N*A,B]
print(min(li))

Submission status: Accepted

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

x = N*A
y = B

li = [x,y]
print(min(li))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
p=input().rstrip().split(' ')
print(min((int(p[0])*int(p[1])),int(p[2])))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

train = n*a

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

Submission status: Accepted

Solution code:
a,b,c=input().split()
a1=int(a)
b1=int(b)
c1=int(c)
d=a1*b1
if d<=c1:
  print(d)
else:
  print(c1)

Submission status: Accepted

Solution code:
n, a, b = input().split()
n = int(n)
a = int(a)
b = int(b)
print("{}".format(min(n*a, b)))

Submission status: Accepted

Solution code:
def minimizer(n,a,b):
  first=n*a
  second=b
  if first>second:
    return second
  else: 
    return first

inputing=input()
input_sep=inputing.split(" ")
input_sep=[int(i) for i in input_sep]
print(minimizer(int(input_sep[0]),int(input_sep[1]),int(input_sep[2])))

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input().split()#lines[0]つまり１行目をスペースで区切る.dataは配列
N = int(data[0])#人数
A = int(data[1])#一人分の電車料金
B = int(data[2])#N人分のタクシー料金
Bp = B / N#一人分のタクシー料金
total = []#要素数0のリストを用意

for i in range(N+1):
    total.append(A*i + Bp*(N-i))#リストに計算結果を入れていく
min = total[0]
for i in range(len(total)):
    if min > total[i]:
        min = total[i]
pri_min = int(min)
print(pri_min)

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(w) for w 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:
a = [int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
D = map(int, raw_input().split())
n = D[0]
a = D[1]
b = D[2]

if n*a < b:
  print n*a
elif n*a == b:
  print n*a
else:
  print b

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:
import sys
from fractions import gcd
import bisect
from operator import itemgetter

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()

s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]



n, a, b = na()

train = a * n
taxi = b


print(min([train, taxi]))

Submission status: Accepted

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

Submission status: Accepted

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

print(min(N * A, B))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math

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

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

Submission status: Accepted

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

ans_min = n * a

for i in range(0, n + 1):
    ans = i * a + (n - i) * b / n
    if ans < ans_min:
        ans_min = int(ans)

print(ans_min)

Submission status: Accepted

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

a=N*A
b=B

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

Submission status: Accepted

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

train=a[0]*a[1]
taxi=a[2]
if (train<=taxi):
  print(train)
else:
  print(taxi)

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

import sys
import math
import collections
import itertools
def input(): return sys.stdin.readline().strip()
def gcd(x, y): return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y): return (x * y) // gcd(x, y)
MOD = 10 **9 + 7

# N = int(input())
# L = [int(x) for x in input().split()]
N, A, B = map(int, input().split())
# A = [int(input()) for _ in range(N)]
# S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
human_num, train_value, taxi_num = tuple(int(i) for i in input().split(" "))
print(min(train_value * human_num, taxi_num))

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

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(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:
import sys
def input(): return sys.stdin.readline().strip()
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:
info = input().split(" ")
N = int(info[0])
A = int(info[1])
B = int(info[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
a = x * y
print(min([a,z]))

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

print(min(a*n, b))

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    print(solve(input()))

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

Submission status: Accepted

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

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

ans = min(A * N, B)

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,a,b = map(int,input().split())
def money(n,a,b):
  result = a * n
  if result >= b:
    return b
  else:
    return result

print(money(n,a,b))

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

Submission status: Accepted

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

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

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print str(min_value)

Submission status: Accepted

Solution code:
A,B,C=[int(x)for x in input().split()];print(C if A*B>C else A*B)

Submission status: Accepted

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

train = n * a
taxi = b

print(min(train, taxi))

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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