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

Submission status: Accepted

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

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Accepted

Solution code:
import sys
import math

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


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

Submission status: Accepted

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

print(min(B, A*N))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
x = [b * a,c]
x.sort()
print(x[0])

Submission status: Accepted

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

if not ( 1 <= N <= 20 and 1 <= A <= 50 and 1 <= B <= 50 ): sys.exit()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(min(n * a, b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)

N, A, B = rl()

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

Submission status: Accepted

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

c = n * a 

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#入力:N,M(int:整数)
def input2():
	return map(int,input().split())
  
n,a,b=input2()
train=a*n
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())
print(min(N*A,B))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
# n = int(input())
# li = list(map(int, input().split()))
n, a, b = map(int, input().split())
print(min(a*n, b))

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N, A, B = LI()

    print(min(A * N, B))

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

print(min(N*A,B))

Submission status: Accepted

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

densya = N * A

if densya <= B:
    print(densya)

else:
    print(B)

Submission status: Accepted

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

    
if '__main__' == __name__:
    resolve()

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

a=N*A

print(min(a,B))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

    #N = int(input())
    N, A,B = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
    print(min(A*N,B))





if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

def main():
    n, a, b = map(int, input().split())
    print(min(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:
#!/usr/bin/env python3
# -*- 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:
N, A, B = map(int, input().split())
ans = min(N*A, B)
print(ans)

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:
from sys import stdin
N, A, B = input().split()
train = int(N) * int(A)
taxi = int(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())
t = N*A
if t > B:
  print(B)
else:
  print(t)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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 a*n<b or a*n==b:
  print(a*n)
else:
  print(b)

Submission status: Accepted

Solution code:
import numpy as np

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

print(min(costs))

Submission status: Accepted

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

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

elif a*n<b:
    print(a*n)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,a,b=[int(x) for x in input().rstrip().split()]
if a<(b/n):
  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:
arr = input().split()
n,train,taxi = int(arr[0]), int(arr[1]), int(arr[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

url = "https://atcoder.jp//contests/abc133/tasks/abc133_a"

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

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
a=sys.stdin.readline()
res = [int(x) for x in a.split() if x.isdigit()] 
N,A,B= [res[i] for i in (0,1,2)]
if 1<=N<=20 and 1<=A<=50 and 1<=B<=50:
    x=N*A
    if x>B:
        print(B)
    else:
        print(x)

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:
x,y,z = [int(a) for a in input().split()]

print(min(z, x*y))

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    n, a, b = LI()
    print(min(a*n, b))

main()

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

train_cost = N * A
taxi_cost = B

print(min(train_cost, taxi_cost))

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

print(min(A*N, B))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)

#a = int(input())
#b = list(map(int, input().split()))
n, a, b = map(int, input().split())
#s = input()
#s,t = input().split()
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]

ans = min(a*n, b)

print(ans)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

print(min(N*A, B))

Submission status: Accepted

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

train = inp[0] * inp[1]

if train < inp[2]:
    print(train)
else:
    print(inp[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())

ans = n*a

print(min(ans,b))

Submission status: Accepted

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

Submission status: Accepted

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

train = N*A
taxi = B

print(min(train, taxi))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

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


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

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

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

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

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
#import numpy as np
INF = float("inf")
#d = defaultdict(int)
#d = defaultdict(list)
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())[:-1]
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [list(input())[:-1] for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
N,A,B = map(int,input().split())
miN = min(N*A,B)
print(miN)

Submission status: Accepted

Solution code:
def main():
  num = list(map(int,input().split()))
  if num[0]*num[1]<=num[2]:
    print(num[0]*num[1])
  else:
    print(num[2])
main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy

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())
cost_train = a * n
cost_bus = b

if cost_train >= cost_bus:
  print(cost_bus)
else:
  print(cost_train)

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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 = []

c.append(n*a)
c.append(b)

print(min(c))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N,A,B = map(int, input().split())
if A<(B/N):
    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:
l = list(map(int, input().split()))
n=l[0]
a=l[1]
b = l[2]

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

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline
N,A,B = (int(x) for x in input().split())
train =A *N
taxi =B
print(min(train,taxi))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(min(a*b, c))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

# check
NA = N * A
print(min(NA, B))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def tort(n, a, b):

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

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

    A = N * A

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

    return


if __name__ == "__main__":
    main()
    sys.exit(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

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

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import copy

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())
c=n*a
print(min(c,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 -*-
"""
Created on Tue May 12 14:07:41 2020

@author: shinba
"""


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

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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