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

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

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

if __name__ == '__main__':
    resolve()

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

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

    print(min(A * N, B))

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

print(min(n*a, b))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,A,B=map(int,input().split()) #1行で1スペースあけて入力


price1=A*N
price2=B

if price1>=price2:
    print(int(price2))
else:
    print(int(price1))

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


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

Submission status: Accepted

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


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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
n, a, b = M()
print(min(n*a, b))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

x = N*A

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
###==================================================
### import
#import bisect
#from collections import Counter, deque, defaultdict
#from copy import deepcopy
#from functools import reduce, lru_cache
#from heapq import heappush, heappop
#import itertools
#import math
#import string
import sys
### stdin
def input(): return sys.stdin.readline().rstrip()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]
### stdout
def OutH(lst, deli=' '): print(deli.join(map(str, lst)))
def OutV(lst): print('\n'.join(map(str, lst)))
### setting
sys.setrecursionlimit(10 ** 6)
### utils
int1 = lambda x: int(x) - 1
### constants
INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)
###---------------------------------------------------

N, A, B = iInM()

ans = min(A * N, B)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(min(N*A,B))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(min(N * A, B))

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

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

Submission status: Accepted

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

Z=N*A

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

Submission status: Accepted

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

x1 = N * A

if (x1 <= B):
    print(x1)

elif(x1 > B):
    print(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:
# -*- 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 = input().split()

N = int(N)

A = int(A)

B = int(B)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

ans = min(B, N_jikan * A)

print(ans)

Submission status: Accepted

Solution code:
def actual(n, a, b):
    return min(n * a, b)

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

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    ans = min(A * N, B)

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if b > n * a:
  print(n * a)
else:
  print(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:
from sys import stdin
N,A,B = [int(x) for x in stdin.readline().rstrip().split()]
print(min(A*N,B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(a * t, b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

NA=N*A

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

Submission status: Accepted

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

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

x = min(n*a,b)

print(x)

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

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

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n, a, b = mi()
    print(min(n * a, b))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import bisect
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
zikan,tanka,ryoukinB=map(int,input().split())
ryoukinA=tanka*zikan
ans=min(ryoukinA,ryoukinB)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 01:20:03 2020

@author: shinba
"""

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

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

Submission status: Accepted

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

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

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

#############
# Main Code #
#############

N,A,B = inputIL()

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:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

tmp = N*A
if tmp <= B:
    print(tmp)
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:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]
## math ##
def to_bin(x: int) -> str: return format(x, 'b') # rev => int(res, 2)
def to_oct(x: int) -> str: return format(x, 'o') # rev => int(res, 8)
def to_hex(x: int) -> str: return format(x, 'x') # rev => int(res, 16)
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i): is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]
def prime_factor(n):
    """Return a list of prime factorization numbers of n"""
    res = []
    for i in range(2,int(n**0.5)+1):
        while n%i==0: res.append(i); n //= i
    if n != 1: res.append(n)
    return res
## libs ##
from itertools import accumulate as acc, combinations as combi, product, combinations_with_replacement as combi_dup
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left
#======================================================#

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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())
P=A*N#プラン1
if P>B:
  print(B)
else:print(P)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
N, A, B = ri_()
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:
def main():
    n,a,b = (int(x) for x in input().split())
    print(min(b,a*n))

if __name__ == '__main__':
    main()

Submission status: Accepted

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