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: Accepted

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

plan1 = a * n
plan2 = b

if (plan1 <= plan2):
   print(plan1)
else:
   print(plan2)

Submission status: Accepted

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

Submission status: Accepted

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

n, a, b = map(int, sys.stdin.readline().split())

def main():
    return min(a * n, b)

if __name__ == '__main__':
    ans = main()
    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())
sum1 = a*n
print(min(sum1,b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

p1=a*n
p2=b

if p1>=p2:
  print(p2)
else:
  print(p1)

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

Submission status: Accepted

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

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

plan_1 = A * N

plan_2 = B

print(min(plan_1, plan_2))

Submission status: Accepted

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

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

Submission status: Accepted

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

print(min(A * N, B))

Submission status: Accepted

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

Submission status: Accepted

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

print(min(N *A, B))

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# vim: set fileencoding=utf-8:
import sys
input = sys.stdin.readline

"""
H = int(input())
h = [int(ele) for ele in input().split()]
h = [0] + h
"""


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


def bfs(queue):
    global yet, graph
    if len(queue) == 0:
        return
    yet.remove(queue[-1])

    for i, adjacency in enumerate(graph[queue[-1]]):
        if adjacency == 1 and (i in yet) and (i not in queue):  # 隣接かつ未探索であれば、stackにpush
            queue.appendleft(i)
    else:
        queue.pop()
        bfs(queue)


def dfs(stack):
    global yet, graph
    yet.remove(stack[-1])

    for i, adjacency in enumerate(graph[stack[-1]]):
        if adjacency == 1 and i in yet:  # 隣接かつ未探索であれば、stackにpush
            stack.append(i)
            dfs(stack)
    else:
        stack.pop()


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
        if i != n // i:
            divisors.append(n//i)
    return divisors


class Node():

    def __init__(self):
        self.idx = None
        self.left = None
        self.right = None
        self.parent = None
        return

    def pre_order(self):
        global pre_order_str
        pre_order_str += str(self.idx) + " "
        if self.left:
            self.left.pre_order()

        if self.right:
            self.right.pre_order()

    def in_order(self):
        global in_order_str

        if self.left:
            self.left.in_order()

        in_order_str += str(self.idx) + " "

        if self.right:
            self.right.in_order()

    def post_order(self):
        global post_order_str
        if self.left:
            self.left.post_order()

        if self.right:
            self.right.post_order()

        post_order_str += str(self.idx) + " "


class HeapHelper():
    """HeapContrler.
    完全二分木を二分ヒープで表現した配列 A に対して、
    HeapHelper.parent(idx) とするとそのノードの親の添字を返す
    存在しない場合は Falseを返す

    Returns:
        [type] -- [description]
    """

    def __init__(self):
        return

    @staticmethod
    def parent(i):
        if i == 1:
            return False

        return int(i/2)

    @staticmethod
    def left(i):
        l_idx = 2*i
        if H < l_idx:
            return False

        return l_idx

    @staticmethod
    def right(i):
        r_idx = 2*i + 1
        if H < r_idx:
            return False

        return r_idx


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC080a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

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

print(min(A*N,B))

Submission status: Accepted

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

print(min(n*a,b))

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
 
ni = lambda:int(ns())
nl = lambda:list(map(int,stdin.readline().split()))
ns = lambda:stdin.readline().rstrip()  # ignore trailing spaces

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N,A,B = MI()
    print(min(B,N*A))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(parking_fee)

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

N_A = (N*A)

if N_A <= B:
    print(N_A)
else:      
    print(B)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")

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

main()

Submission status: Accepted

Solution code:
from sys import stdin
n,a,b = [int(x) for x in stdin.readline().rstrip().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 print(b)

Submission status: Accepted

Solution code:
def examA():
    N, A, B = LI()
    ans = min(N*A,B)
    print(ans)


import sys,copy,bisect,itertools
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
# readline = sys.stdin.buffer.readline
# readlines = sys.stdin.buffer.readlines
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics

def main():
    a, t, b = (int(x) for x in read().split())
    if a * t >= b: print(b)
    else: print(a * t)


if __name__ == "__main__":
    # execute only if run as a script
    main()

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

Submission status: Accepted

Solution code:
T, A, B=(int(x) for x in input().split())
print(min(A*T, B))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, A, B = map(int, input().split())
p1 = A * N
p2 = B
if(p1 <= p2):
  print(p1)
else:
  print(p2)

Submission status: Accepted

Solution code:
# A - Parking
n, a, b = [int(s) for s in 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:
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 (n*a)<b:
    print(n*a)
else:
    print(b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
N,A,B = [int(x) for x in input().split()]
print(min(N*A,B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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(s) for s in 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:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n,a,b=INTM()
    print(min(n*a,b))
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

aa080()

Submission status: Accepted

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


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

plan_A = A * N
plan_B = B

if plan_A < plan_B:
    print(str(plan_A))
else:
    print(str(plan_B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC080A
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())
print(min(a*n, b))

Submission status: Accepted

Solution code:
x=list(input().split())
x1=int(x[0])
x2=int(x[1])
x3=int(x[2])
plan1=x1*x2
plan2=x3

if plan1>=plan2:
  print(plan2)
else:
  print(plan1)

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

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

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

Submission status: Accepted

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

plan1 = A*N
plan2 = B

if plan1 > plan2:
    print(plan2)
else:
    print(plan1)

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

Submission status: Accepted

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

X = A * N
if X < B :
    print(X)
    
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())
cost = N * A
print(min(cost, 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:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""


N, A, B =  map(int, sys.stdin.readline().split())
print(min(N * A, B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def main():


   N,A,B = 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())
if 1 <= n <= 20 and 1 <= a <= 100 and 1 <= b <= 2000:
    print(min(a * n, b))
else:
    print('hoge!')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
import sys
import  math
from statistics import *
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    test()

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

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

Submission status: Accepted

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

print (min(A * N, B))

Submission status: Accepted

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

Submission status: Accepted

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

else:
    min=b

print(min)

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

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

Submission status: Accepted

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

print(min(b, a * n))

Submission status: Accepted

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

print(min(a*n,b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#80

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

Submission status: Accepted

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

print(min(p1,b))

Submission status: Accepted

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

Submission status: Accepted

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

plan_1 = A*N
plan_2 = B

ans=min(plan_1,plan_2)
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(N, A, B)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

# solve & output
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(B if N * A > B else N * A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
i1 = input().split(' ')
a=int(i1[0])*int(i1[1])
b=int(i1[2])

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