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:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math

# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N,A,B = inputMap()
    
    ans = min(B, N*A)
    print(ans)
            	
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())
p1 = n*a
print(min(p1, 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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

input = sys.stdin.readline

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

main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
N,A,B = [int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
# ABC080-A
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 a*n >= b:
    print(b)
    exit()
if a*n <= b:
    print(a*n)

Submission status: Accepted

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

A = n*a

if A >= b:
    print(b)
else:
    print(A)

Submission status: Accepted

Solution code:

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, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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 LIST(): return list(map(str, input().split()))
# def LIST(): return list(input())

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

Submission status: Accepted

Solution code:
N, A, B = [int(nab) for nab 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())

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:
def smaller(x, y):
	if x < y:
		return x
	return y

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

print(min(n*a , b))

Submission status: Accepted

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

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

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
# Your code here!

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

# print(N)
# print(A)
# print(B)

# print(N * A)
# print(B)

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

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:
a = list(map(int,input().split()))
b = a[0]*a[1]
c = a[2]

if b <= c:
  print(b)
else:
  print(c)

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
#96
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(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(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:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

N, A, B = nl()

print(min(A*N, B))

Submission status: Accepted

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


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
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())

sum1 = N*A

if sum1 >= B:
    print(B)
else:
    print(sum1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print (ans)

Submission status: Accepted

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

Submission status: Accepted

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


abc()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
MOD = 1000000007
def POW(x, y): return pow(x, y, MOD)
def INV(x, m=MOD): return pow(x, m - 2, m)
def DIV(x, y, m=MOD): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()

N,A,B=LI()

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

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

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

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

Submission status: Accepted

Solution code:



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



if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

print(min(a*t,b))

Submission status: Accepted

Solution code:
def smaller(x, y):
	if x < y: return x
	return y

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

plan1=x*a
plan2=b

if plan1<plan2:
    print(plan1)

elif plan1==plan2:
    print(plan1)

else:
    print(plan2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from collections.abc import Iterable
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
    from math import gcd
except Exception:
    from fractions import gcd


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


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
    result = solve(N, A, B)
    if isinstance(result, Iterable):
        result = '\n'.join([str(v) for v in result])
    print(result)

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:

l = list(map(int, input().split()))

p1 = l[0] * l[1]
p2 = l[2]

print(min(p1, p2))

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(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:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    a, b, c = (int(_) for _ in input().split())  
    print(min(a*b,c))
    
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())
print(n*a if n*a<b else b)

Submission status: Accepted

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

tmp = int(N * A)
print(min(tmp, B))

Submission status: Accepted

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

m=n*a

print(min(m,b))

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    n,a,b = f()
    print(min(n*a, b))

solve()

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

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

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:

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


def submit():
    n, a, b = read_input()
    print(min(b, n*a))


if __name__ == '__main__':
    submit()

Submission status: Accepted

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

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:
# /usr/bin/python
# -*- coding: utf-8 -*-
import sys
import math



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:
#ABC080A
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:
# coding: utf-8
# user: herp_sy

def quicksort(seq):
    if len(seq) < 1:
        return seq
    pivot = seq[0]
    left = []
    right = []
    for x in range(1, len(seq)):
        if seq[x] <= pivot:
            left.append(seq[x])
        else:
            right.append(seq[x])
    left = quicksort(left)
    right = quicksort(right)
    foo = [pivot]
    return (left + foo + right)

# , = map(int, input.split())
#  = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(min(B, A*N))

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


n, a, b = inl()

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

Submission status: Accepted

Solution code:
# ABC080A - Parking
n, a, b = list(map(int, input().rstrip().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(i) for i in input().split()]
print(n*a) if n*a<=b else print(b)

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template


N, A, B = mi()
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:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n, a, b = LI()
    print(min(n*a,b))
    return

#B
def B():
    a = S()
    print(a.count("1"))
    return

#C
def C():
    n = II()
    a = list(str(n))
    if not n % sum(a):
        print("Yes")
    else:
        print("No")
    return

#D
def D():
    n = II()
    a = LI()
    ans = 0
    for a_ in a:
        while not a_ % 2:
            ans += 1
            a_ /= 2
    print(ans)
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

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

a = input()

a = re.split(" ",a)

b = int(a[0])*int(a[1])
c = int(a[2])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    n,a,b = LI()
    print(min(n*a,b))
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#I
def I_():
    return

#J
def J():
    return

#Solve
if __name__ == "__main__":
    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())
if b > a*n:
  print(a*n)
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 = 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())
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:
#080 A

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input().split()

n1 = int(str[0]) * int(str[1])
n2 = int(str[2])
if n1 <= n2:
  print(n1)
else:
  print(n2)

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

Submission status: Accepted

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

Submission status: Accepted

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

a_fee = a * n
b_fee = b

if a_fee < b_fee:
    print(a_fee)
else:
    print(b_fee)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(string):
    n, a, b = map(int, string.split())
    return str(min(n * a, b))


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

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