Problem:


Score : 100 points

Problem Statement

You are parking at a parking lot. You can choose from the following two fee plans:

Plan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours.

Plan 2: The fee will be B yen, regardless of the duration.

Find the minimum fee when you park for N hours.

Constraints

1≤N≤20

1≤A≤100

1≤B≤2000

All input values are integers.

Input

Input is given from Standard Input in the following format:

N A B

Output

When the minimum fee is x yen, print the value of x.

Sample Input 1

7 17 120

Sample Output 1

119

If you choose Plan 1, the fee will be 7×17=119 yen.

If you choose Plan 2, the fee will be 120 yen.

Thus, the minimum fee is 119 yen.

Sample Input 2

5 20 100

Sample Output 2

100

The fee might be the same in the two plans.

Sample Input 3

6 18 100

Sample Output 3

100



Sample input:
7 17 120


Sample output:
119

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 080_a
N,A,B=map(int,input().split())
if (1<=N&N<=20)&(1<=A&A<=100)&(1<=B&B<=200):
    p1=A*N
    p2=B
    print(min(p1,p2))

Submission status: Wrong Answer

Solution code:
a,b,c=(int(x) for x in input().split())
d = ( a * b )
if d > c:
    print(d)
elif c > d:
    print(c)
elif c == d:
    print(c)

Submission status: Wrong Answer

Solution code:
a,b,c=(int(x) for x in input().split())
d = ( a * b )
if d > b:
    print(d)
elif b > d:
    print(b)
elif b == d:
    print(b)

Submission status: Wrong Answer

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

price = [a * n] + [b]
print(max(price))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(N * A + B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,t,i=input().split()
a=int(a)
t=int(t)
x = a * t
i=int(i)
c=min(x,i)

Submission status: Wrong Answer

Solution code:
a,t,i=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(i)
c=min(x,i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == '__main__':

    ABC_80_A()

Submission status: Wrong Answer

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

print(max(a*n,b))

Submission status: Wrong Answer

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

print(max(a*n,b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
cnt = 0
for i in range(3):
    if s[i] == '1':
        cnt += 1

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,A,B = map(int,input().split(" "))
planA = N * A
planB = B
print(max(planA,planB))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

else:
    print(A)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

print(n*a, b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(max(N*A,B))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
NN = 17
XX = [0] * (2**(NN+1)-1)

def addvalue(j, x):
    i = 2**NN + j - 1
    while i >= 0:
        XX[i] += x
        i = (i-1) // 2

def getvalue(j):
    return XX[j+2**NN-1]

def rangesum(a, b):
    l = a + (1<<NN)
    r = b + (1<<NN)
    s = 0
    while l < r:
        if l%2:
            s += XX[l-1]
            l += 1
        if r%2:
            r -= 1
            s += XX[r-1]
        l >>= 1
        r >>= 1
    return s

def debug():
    mm = 10
    tmp = [(i, XX[i+2**NN-1]) for i in range(2**NN) if XX[i+2**NN-1] != 0]
    if len(tmp) <= mm:
        print(tmp)
    else:
        print(tmp[:mm])

addvalue(3, 10)
print(rangesum(1,12))
addvalue(5, 7)
print(rangesum(1,12))
addvalue(13, 5)
print(rangesum(1,12))
print(rangesum(1,15))
debug()
print(getvalue(6))

for i in range(10**5):
    a, b = i, i**2
    # print("ADD", a, b)
    addvalue(a, b)
    c, d = i*2%(1<<NN), (i+2)*2%(1<<NN)
    c, d = min(c, d), max(c, d)
    # print("Sum", c, d)
    # print(rangesum(c, d))
    x = rangesum(c, d)

print(3)

Submission status: Wrong Answer

Solution code:
import time
import random

## 
# DEV


NN = 17
XX = [0] * (2**(NN+1)-1)

def addvalue(j, x):
    i = 2**NN + j - 1
    while i >= 0:
        XX[i] += x
        i = (i-1) // 2

def getvalue(j):
    return XX[j+2**NN-1]

def rangesum(a, b):
    l = a + (1<<NN)
    r = b + (1<<NN)
    s = 0
    while l < r:
        if l%2:
            s += XX[l-1]
            l += 1
        if r%2:
            r -= 1
            s += XX[r-1]
        l >>= 1
        r >>= 1
    return s

def debug():
    mm = 10
    tmp = [(i, XX[i+2**NN-1]) for i in range(2**NN) if XX[i+2**NN-1] != 0]
    if len(tmp) <= mm:
        print(tmp)
    else:
        print(tmp[:mm])

addvalue(3, 10)
print(rangesum(1,12))
addvalue(5, 7)
print(rangesum(1,12))
addvalue(13, 5)
print(rangesum(1,12))
print(rangesum(1,15))
debug()
print(getvalue(6))

sTime = time.time()
for i in range(10**5):
    a, b = random.randrange(1<<NN), random.randrange(10**5)
    # print("ADD", a, b)
    # addvalue(a, b)
    ii = 2**NN + a - 1
    while ii >= 0:
        XX[ii] += b
        ii = (ii-1) // 2
    # debug()
    c, d = random.randrange(1<<NN), random.randrange(1<<NN)
    c, d = min(c, d), max(c, d)
    # print("Sum", c, d)
    # print(rangesum(c, d))
    # x = rangesum(c, d)

print(time.time()-sTime, "sec")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
0

Submission status: Wrong Answer

Solution code:
from sys import stdin
a, b, c = [int(x) for x in stdin.readline().rstrip().split()]
if a*b>c:
  print(a*b)
else:
  print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l,m,n=map(int,input(" ").split())
if l*m>=n:
  print(l*n)
else:
  print(n)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
N,A,B = map(int,input().split())
if A * N >= B:
  print("B")
else:
  print("{}".format(A*N))

Submission status: Wrong Answer

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math

n=input().split()
a = []
for i in range(len(n)):
    a.append(int(n[i]))
if (a[0]*a[1]) > a[2]:
    print(a[0]*a[1])
else: print(a[2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

min(n*a, b)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def charge(N,A,B):
    plan1 = N * A
    plan2 = B
    if plan1 < plan2:
        return plan1
    else:
        return plan2

Submission status: Wrong Answer

Solution code:
moji=map(int, input().split())
max_1=max(moji)
print(max_1)

Submission status: Wrong Answer

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


max_1=min(moji)
print(max_1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

solve()

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

plan1 = a * n
plan2 = b

print(min(plan1, plan2))

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def I():
    #1 line 1 int
     return int(sys.stdin.readline().rstrip())
def LI():
    #1 line n int
     return list(map(int,sys.stdin.readline().rstrip().split()))
def S():
    #1 line 1 string
     return sys.stdin.readline().rstrip()
def LS():
    #1 line n strings
     return list(sys.stdin.readline().rstrip().split())

N,A,B=LI()
x=N*A
y=B

if x <= y:
    print(x)
else:
    print(y)

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def I():
    # 1 line 1 int
    return int(sys.stdin.readline().rstrip())
def LI():
    # 1 line n ints
    return list(map(int,sys.stdin.readline().rstrip().split()))
def S():
    # 1 line 1 string
    return sys.stdin.readline().rstrip()
def LS():
    # 1 line n strings
    return list(sys.stdin.readline().rstrip().split())

N, A, B = LI()

x = A*N
y = B

if x <= y:
    print(x)
else:
    print(y)

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:
# 駐車場があり、以下の二種類のプランのどちらかを選んで駐車できます。 プラン 1 : T 時間駐車した場合、 A × T 円が駐車料金となる。
# プラン 2 : 駐車した時間に関わらず B 円が駐車料金となる。 N 時間駐車するとき、駐車料金は最小でいくらになるか求めてください。

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

print(min(N * A, B))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)

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

print(min(b, n*a))

Submission status: Accepted

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

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

Submission status: Accepted

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

prices = [A * N, B]

print(min(prices))

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

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:
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:
lst = input().split()
print(min([int(lst[0]) * int(lst[1]), int(lst[2])]))

Submission status: Accepted

Solution code:

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



plan_A = A * N
plan_B = B

print(min(plan_A, plan_B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,a,b=map(int,input().split())
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:
#https://atcoder.jp/contests/abc080/tasks/abc080_a
S_list = list(map(int,input().split()))
N,A,B = S_list
if N * A > B:
    result = B
else:
    result = N * A
print(result)

Submission status: Accepted

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

plan1 = a * t
plan2 = b

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

Submission status: Accepted

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

print(min(a * n, b))

Submission status: Accepted

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

Submission status: Accepted

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

print(min(N * T, B))

Submission status: Accepted

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

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

Submission status: Accepted

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

print(min(n * a, b))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

answer = min(park_price)
print(answer)

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())
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 - Parking
# https://atcoder.jp/contests/abc080/tasks/abc080_a

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

plan = [n * a, b]
print(min(plan))

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:
'''
問題：
    駐車場があり、以下の二種類のプランのどちらかを選んで駐車できます。
    プラン 1 : T時間駐車した場合、A×T 円が駐車料金となる。
    プラン 2 : 駐車した時間に関わらず B 円が駐車料金となる。
    N時間駐車するとき、駐車料金は最小でいくらになるか求めてください。
'''

'''
制約：
    1 ≦ N ≦ 20
    1 ≦ A ≦ 100
    1 ≦ B ≦ 2000
    入力は全て整数
'''

# 標準入力から N, A, B の値を取得する
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())
print(min(a * n, b))

Submission status: Accepted

Solution code:
# 080a

def atc_080a(NAB: str) -> int:
    N, A, B = map(int, NAB.split(" "))
    return min(N * A, B)

NAB = input()
print(atc_080a(NAB))

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

Submission status: Accepted

Solution code:
# 数値の取得
N,A,B = map(int,input().split())

# 料金の最安値を出力
plan1 = A * N
plan2 = B
print(min(plan1,plan2))

Submission status: Accepted

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

plan1 = N * A
plan2 = B

min_plice = min(plan1,plan2)
print(min_plice)

Submission status: Accepted

Solution code:
# A - Parking
# N A B

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

# A * N < B ⇔ B

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:
time, normal_cost, unlimited_cost = map(int, input().split())
if normal_cost * time < unlimited_cost:
    total_cost = normal_cost * time
else:
    total_cost = unlimited_cost
print(total_cost)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# N時間駐車した時の最小料金を求める

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#080A
# 1.値を正しく取得
a, b, c = (int(x) for x in input().split())

# 2.正しく処理
plan1 = a * b
plan2 = c

resalt=[plan1,plan2]

print(min(resalt))

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:
# 080_a
N, A, B = map(int, input().split())
if (1 <= N & N <= 20) & (1 <= A & A <= 100) & (1 <= B & B <= 2000):
    p1 = A * N
    p2 = B
    print(min(p1, p2))

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

min_price_plan = min(parking_time * time_price, anytime_price)

print(min_price_plan)

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

print(min(A * N, B))

Submission status: Accepted

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

# プラン 1: T時間駐車した場合、A × T円 が駐車料金となる。
# プラン 2: 駐車した時間に関わらず B円 が駐車料金となる。
# N時間駐車するとき、駐車料金は最小でいくらになるか求めてください。

plan_A = A * N
plan_B = B

print(min(plan_A, plan_B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    print(min(N * A, B))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
hours, price_per_h, fixed_charge = map(int, input().split())

plan_a = hours * price_per_h

if plan_a >= fixed_charge:
    print(fixed_charge)
elif plan_a < fixed_charge:
    print(plan_a)

Submission status: Accepted

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

p1 = A * N
p2 = B
a = [p1, p2]
print(min(a))

Submission status: Accepted

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

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

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

price = [a * n] + [b]
print(min(price))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
li = input().split(" ")
lis =[int(li[0])*int(li[1]),int(li[2])]
print(min(lis))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding = SJIS

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

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

print(min(A,b))

Submission status: Accepted

Solution code:
import sys
import numpy as np
import math  # gcdもあるよ
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate #リストを与えると累積和を返す
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache #メモ化

def main():
    N = list(map(int,input().split()))
    A1 = N[0] * N[1]
    ans = N[2]
    if A1 < ans:
        print(A1)
    else: print(ans)
    return 0

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]


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 (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
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

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

    print(min(a*n, b))


if __name__ == '__main__':
    main()

Submission status: Accepted

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