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

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

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

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())
v = a*n

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

Submission status: Accepted

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

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

print(min(A*N, B))

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

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(a*n,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 accumulate, permutations, combinations, product, groupby
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
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(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([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:
N,A,B = map(int,input().split())
if N*A>=B:
    print(B)
elif N*A<B:
    print(N*A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 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())
S = N*A
if B < S or B == S:
  print(B)
else:
  print(S)

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:
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

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


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi
#from operator import itemgetter
from copy import deepcopy
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [LI()for i in range(n)]
inf = 10**17
mod = 10**9 + 7

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

Submission status: Accepted

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

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

Submission status: Accepted

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

else:
    print(n*a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(x*y, z))

Submission status: Accepted

Solution code:
hours, hourly, full = map(int, input().split())

print(min([hourly*hours, full]))

Submission status: Accepted

Solution code:

def resolve():
    N, A, B = list(map(int, input().split()))
    print(B if N * A > B else N * A)


if '__main__' == __name__:
    resolve()

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

Submission status: Accepted

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

li = [ N*A, B]

print(min(li))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = min( N * A, B )

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/A-Parking.py
#
n, a, b = map(int, input().split())
planA = n * a
planB = b
if planA >= planB:
    print(planB)
else:
    print(planA)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans1=A*N
ans2=B


if ans1<ans2:
    print(ans1)
else:
    print(ans2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
NAB = list(map(int, input().split()))
ans = min(NAB[0]*NAB[1],NAB[2])
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=[int(i) for i in input().split()]

one=n*a
two=b

if one>two:
    print(two)
else:
    print(one)

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:
#!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
N, A, B = map(int, input().split())
ans1 = A * N
ans2 = B
print(min(ans1, ans2))

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

if N * A <= B:
	answer = N * A
else:
	answer = B

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

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())  #複数の数字

C = N * A

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

Submission status: Accepted

Solution code:
# ABC 080: A – Parking
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(n*a)
else:
    print(b)

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    num = min (a[0]*a[1],a[2])
    print(num)

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

ans = []
ans.append(n*a)
ans.append(b)

print(min(ans))

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

print(min(a*n,b))

Submission status: Accepted

Solution code:
tmp = input().split()
val = [int(v) for v in tmp]
if val[0] * val[1] >= val[2]:
  ans = val[2]
else:
  ans = val[0] * val[1]
print(ans)

Submission status: Accepted

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

print(min(N*A,B))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(min(A*N,B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import string


def readints():
    return list(map(int, input().split()))


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

#N = int(input())
#s = [input() for i in range(N)]
#M = int(input())
#t = [input() for i in range(M)]
# print(s)
# print(t)

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

Submission status: Accepted

Solution code:
l = [int(x) for x in input().split(' ')]
print(min(l[0]*l[1],l[2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
class Solution:
    def solve(self, N: int, A: int, B: int) -> str:

        return min(N*A, B)


if __name__ == '__main__':

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

    # solve
    solution = Solution()
    print(solution.solve(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:
#abc080
t,a,b=map(int,input().split())
print(min(a*t,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())
a=A*N
b=B
print(min(a,b))

Submission status: Accepted

Solution code:
time, planA, planB = map(int,input().split())

prise_A = time * planA
prise_B = planB

if prise_A >= prise_B:
    print(prise_B)
else:
    print(prise_A)

Submission status: Accepted

Solution code:
# Author: cr4zjh0bp
# Created: Thu Mar 12 20:28:00 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

N, A, B = na()

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

Submission status: Accepted

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

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

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:
# coding: utf-8
# Your code here!
n, a, b = map(int,input().split())
print(min(a*n, b))

Submission status: Accepted

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

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

print( min(A*N, B) )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    print(min(n*a, b))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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:
def parking(n , a , b):

    return b if n * a > b else n * a

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#080_A
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(B)
else:
    print(A*N)

Submission status: Accepted

Solution code:

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
mod=10**9+7

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(A*N, B))

Submission status: Accepted

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

p1 = a * n

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    parking_hour, fee_par_hour, flat_fee = map(int, input().split())
    print(min(parking_hour * fee_par_hour, flat_fee))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

p1 = int(N) * int(A)
p2 = int(B)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力 : 数字3つ
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())

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())
x = a*n
if x<b:
    ans = x
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())
print(min(n * a , b))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
from collections import deque
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())
print(min(N * A, B))

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys
import itertools

# import numpy as np

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

Submission status: Accepted

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

print(min(a*n,b))

Submission status: Accepted

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

Submission status: Accepted

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

ans = min(A * N, B)

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())
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(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:
n,a,b=map(int, input().split())

print(min(n*a, b))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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())

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

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

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

Submission status: Accepted

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

N = x[0]
A = x[1]
B = x[2]

p1 = A * N
p2 = B

if p1 > p2:
  print(p2)

else:
  print(p1)

Submission status: Accepted

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

print(min(a*n, b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(b, N*a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, a, b = map(lambda x: int(x), 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():
    input_string = list(map(int,input().split()))
    N = input_string[0]
    A = input_string[1]
    B = input_string[2]

    price1 = A*N
    price2 = B

    print(min(price1,price2))

main()

Submission status: Accepted

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

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