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

Solution (Python):
import math
import heapq
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect, bisect_left, bisect_right
from collections import defaultdict, deque







def LM(t, r): return list(map(t, r))
def R(): return stdin.readline()
def RS(): return R().split()
def I(): return int(R())
def F(): return float(R())
def LI(): return LM(int,RS())
def LF(): return LM(float,RS())
def ONE_SL(): return list(input())
def ONE_IL(): return LM(int, ONE_IL())
def ALL_I(): return map(int, stdin)
def ALL_IL(): return LM(int,stdin)


def ap(f): return f.append
def pll(li): print('\n'.join(LM(str,li)))
def pljoin(li, s): print(s.join(li))




def main():
	n,a,b = LI()

	print(min(n*a, b))

if __name__ == '__main__':
	main()

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

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

print(min(n * a, b))

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

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

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

Solution (Python):




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

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

print(min(n*a, b))

Solution (Python):


n, a, b = [int(x) for x in input().split()]
ans1 = n*a 
ans2 = b
print(ans1 if ans1 <= ans2 else ans2)

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

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

print(min(n*a, b))

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

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

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

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

Solution (Python):


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

print(min(n*a,b))

Solution (Python):
def read(): return list(map(int, input().split()))

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

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

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