Problem:


Score : 100 points

Problem Statement

N of us are going on a trip, by train or taxi.

The train will cost each of us A yen (the currency of Japan).

The taxi will cost us a total of B yen.

How much is our minimum total travel expense?

Constraints

All values in input are integers.

1 \leq N \leq 20

1 \leq A \leq 50

1 \leq B \leq 50

Input

Input is given from Standard Input in the following format:

N A B

Output

Print an integer representing the minimum total travel expense.

Sample Input 1

4 2 9

Sample Output 1

8

The train will cost us 4 \times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.

Sample Input 2

4 2 7

Sample Output 2

7

Sample Input 3

4 2 8

Sample Output 3

8



Sample input:
4 2 9


Sample output:
8

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())
train = N * A
if (train < B):
    print(train)
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:
nab = input().split()

n = int(nab[0])
a = int(nab[1])
b = int(nab[2])

print(min(a*n, b))

Submission status: Accepted

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

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:
# -*- 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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

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:
from collections import Counter
from collections import deque
from functools import reduce
from operator import mul
from pprint import pprint
import bisect
import copy
import fractions
import itertools
import math
import queue
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))
def COMBINATION(n, r):
    if n < 0 or r < 0 or n < r:
        return 0
    r = min(n-r, r)
    if r == 0:
        return 1
    o = reduce(mul, range(n, n - r, -1))
    u = reduce(mul, range(1, r + 1))
    return o // u
class UnionFind():

    def __init__(self, n):
        self.n = n
        self.node = [i for i in range(n)]
        self.size = [1 for _ in range(n)]

    def same(self, x, y):
        return bool(self.root(x) == self.root(y))

    def root(self, x):
        if self.node[x] == x:
            return x
        else:
            self.node[x] = self.root(self.node[x])  # 経路圧縮
            return self.node[x]

    def unite(self, x, y):
        x, y = self.root(x), self.root(y)
        if x == y:
            return  # 結合不要
        if self.size[x] < self.size[y]:
            x, y = y, x
        self.node[y] = x
        self.size[x] += self.size[y]

    def return_size(self, x):
        return self.size[self.root(x)]


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()
n, a, b = str.split(' ')

n = int(n)
a = int(a)
b = int(b)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, A, B = list(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()))


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

Submission status: Accepted

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

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

# solve & output
print(min(N * A, B))

Submission status: Accepted

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

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
def find_min_expense(N, A, B):
    return min(N * A, B)	      

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

main()

Submission status: Accepted

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

print(min(n*a, b))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, a, b = map(int, input().rstrip().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:
s = input().split(" ")
train = int(s[0]) * int(s[1])
taxi = int(s[2])
if train < taxi:
  print(train)
else:
  print(taxi)

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

Submission status: Accepted

Solution code:
args = input().split()
n = int(args[0])
a = int(args[1])
b = int(args[2])

if n * a < b:
    print(n * a)
else:
    print(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=int(input())
A=int(input())
B=int(input())
'''
s=input().split(" ")
N=int(s[0])
A=int(s[1])
B=int(s[2])
if N*A>=B:
    print(B)
else:
    print(N*A)

Submission status: Accepted

Solution code:
N = input().split(" ")
#print(N)

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

Submission status: Accepted

Solution code:
input_data=input()
input_data=input_data.split()
a=int(input_data[0])
b=int(input_data[1])
c=int(input_data[2])

if a*b<c:
    output=a*b
    
else :
    output=c

print(output)

Submission status: Accepted

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

IA = lambda: [int(x) for x in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input().split(' ')
in0 = int(inp[0])
in1 = int(inp[1])
in2 = int(inp[2])
print(min(in0*in1, in2))

Submission status: Accepted

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

train_fee = int(aaa[0]) * int(aaa[1])
taxi_fee = int(aaa[2])

print(min([train_fee,taxi_fee]))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
#abc133a

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

Submission status: Accepted

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

Submission status: Accepted

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


print(min(N*A, B))

Submission status: Accepted

Solution code:
list = [int(i) for i in input().split()]
if list[0]*list[1] <= list[2]:
    print(list[0]*list[1])
else:
    print(list[2])

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]=[int(_) for _ in input().split()]
tr=a*n
print(tr) if tr<b else print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np
MOD = 3
INF = 1000000000


def input():
    return sys.stdin.readline().rstrip()


def main():
    n, a, b = [int(e) for e in input().split()]

    print(min(a * n, b))


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- encoding : UTF-8 -*-
n, a, b = list(map(int, input().split()))

a_total = n * a

c_min = 0

if a_total > b :
  c_min = b
else :
  c_min = a_total
  
print(c_min)

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

train = n * a

print(min(train,b))

Submission status: Accepted

Solution code:
import sys, itertools, collections
sys.setrecursionlimit(10000)

read_ints = lambda: list(map(int, input().split()))
read_int  = lambda: int(input())

INF = 10 ** 10

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC133A - T or T
def main():
    n, a, b = list(map(int, input().rstrip().split()))
    print(min(n * 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:
a, b, c = [int(i) for i in input().split()]
if a * b > c:
  print(c)
else:
  print(a*b)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,a,b=map(int,input().split())
if(a*n<b):
    print("%d"%(a*n))
else:
    print("%d"%(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 = [int(i) for i in input().split()]
print(min(n[0]*n[1],n[2]))

Submission status: Accepted

Solution code:
#ABC133-A
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return list(input())
n,a,b=IL()
print(min(a*n,b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

i=list(map(int,input().split()))
if i[2]>i[0]*i[1]:
    print(i[0]*i[1])
else:
    print(i[2])

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC133-A

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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

print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if n * a > b:
    ans = b
else:
    ans = n*a

print(ans)

Submission status: Accepted

Solution code:
nums = list(map(int, input().split()))

if nums[0]*nums[1] > nums[2]:
    print(nums[2])
    
elif nums[0]* nums[1] <= nums[2]: 
    print(nums[0] * nums[1])

Submission status: Accepted

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

ans = 1000000000000

for x in range(N+1):
    sum = (N - x) * A + x * B / N
    if sum < ans and sum.is_integer():
        ans = sum

print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, d=DVSR): return pow(x, d - 2, d)
def DIV(x, y, d=DVSR): return (x * INV(y, d)) % d
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(input())

N,A,B=LI()

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:
str = input().split()

train = int(str[0]) * int(str[1])
taxi = int(str[2])

if (train <= taxi):
	print(train)
else:
	print(taxi)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, a, b = (int(_) for _ in input().split())
remainder = 0
train = n * a

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

train=a*n
bus=b

print(min(train,bus))

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:
# -*- coding: utf-8 -*-
a, b, c = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input().split(" ")

tr = int(s[0])*int(s[1])
tx = int(s[2])

if tr<tx:
  print(tr)
else:
  print(tx)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def solve(N, A, B):
    ans = min([N*A, B])
    print(ans)


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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np
from collections import defaultdict
from itertools import combinations

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

print(min(N*A, B))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

n,a,b = input().split(' ')


n = int(n)
a = int(a)
b = int(b)

train = n * a
bus = b

if(train < bus):
  print(train)
else:
  print(bus)

Submission status: Accepted

Solution code:

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

train = NAB[0]*NAB[1]
taxi = NAB[2]

if train > taxi:
    print(taxi)
else:
    print(train)

Submission status: Accepted

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

Submission status: Accepted

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

train = N*A

if train < B:
  print(train)
else:
  print(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 = [int(s) for s in input().split(" ")]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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


if __name__ == "__main__":
  n, a, b = map(int, sys.stdin.readline().rstrip().split(" "))
  print solve(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(N*A)
else:
    print(B)

Submission status: Accepted

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

train = n*a

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

cost_tr = a * n
cost_ta = b

if cost_tr <= cost_ta:
    print(cost_tr)
else:
    print(cost_ta)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding=utf-8

###
### for atcorder program
###

import sys
import math

# math class
class mymath:
    ### pi
    pi = 3.14159265358979323846264338

    ### Prime Number
    def pnum_eratosthenes(self, n):
        ptable = [0 for i in range(n+1)]
        plist = []

        for i in range(2, n+1):
            if ptable[i]==0:
                plist.append(i)
                for j in range(i+i, n+1, i):
                    ptable[j] = 1
        return plist

    ### GCD
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

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

    ### Mat Multiplication
    def mul(self, A, B):
        ans = []
        for a in A:
            c = 0
            for j, row in enumerate(a):
                c += row*B[j]
            ans.append(c)
        return ans

mymath = mymath()

### output class
class output:
    ### list
    def list(self, l):
        l = list(l)
        #print(" ", end="")
        for i, num in enumerate(l):
            print(num, end="")
            if i != len(l)-1:
                print(" ", end="")
        print()

output = output()

### input sample
#i = input()
#N = int(input())
#A, B, C = [x for x in input().split()]
#N, K = [int(x) for x in input().split()]
#inlist = [int(w) for w in input().split()]

#R = float(input())
#A.append(list(map(int,input().split())))

#for line in sys.stdin.readlines():
#    x, y = [int(temp) for temp in line.split()]

#abc list
#abc = [chr(ord('a') + i) for i in range(26)]

### output sample
#print("{0} {1} {2:.5f}".format(A//B, A%B, A/B))
#print("{0:.6f} {1:.6f}".format(R*R*math.pi,R*2*math.pi))
#print(" {}".format(i), end="")

def get_input():
    N = []
    while True:
        try:
            N.append(input())
            #N.append(int(input()))
            #N.append(float(input()))
        except EOFError:
            break
    return N

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

x = A * N
y = B

if x < y:
    y = x

print(y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=[int (i) for i in input().split()]
N=S[0]
A=S[1]
B=S[2]
TRAIN=A*N
BUS=B
if TRAIN > BUS:
  print(BUS)
else:
  print(TRAIN)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    n, a, b = [int(i) for i in input().split()]
    print(min([a * n, b]))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
from functools import reduce
import sys
import math
import bisect
import random
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return list(map(float, sys.stdin.readline().split()))
def LS():return sys.stdin.readline().split()
def SR(n): return [list(sys.stdin.readline())[:-1] for i in range(n)]
def IR(n): return [int(sys.stdin.readline()) for i in range(n)]
def LIR(n): return [list(map(int, sys.stdin.readline().split())) for i in range(n)]
def LSR(n): return [list(map(list, sys.stdin.readline().split())) for i in range(n)]
_gcd = lambda x, y: _gcd(y, x%y) if (x%y) else y
_lcm = lambda x, y: x*y // _gcd(x, y)
def gcd(*numbers):
    return reduce(_gcd, numbers)
def lcm(*numbers):
    return reduce(_lcm, numbers)
sys.setrecursionlimit(1000000)
INF = float('inf')
mod = 1000000007
dire4 = [(1,0), (0,1), (-1,0), (0,-1)]
dire8 = [(1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)]

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

Submission status: Accepted

Solution code:
n, tr, ta = map(int, raw_input().split())

print min(n * tr, ta)

Submission status: Accepted

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

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

taxi_cost = N * A

print(min(taxi_cost, 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())

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

Submission status: Accepted

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

print(min(N*A,B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num=list(map(int,input().split()))

if num[0]*num[1]<num[2]:
  print(num[0]*num[1])
else:
  print(num[2])

Submission status: Accepted

Solution code:
n,a,b=map(int,input().split())
print('{0}'.format(min(b,n*a)))

Submission status: Accepted

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

Submission status: Accepted

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

ans = b if n * a > b else n * a

print(ans)

Submission status: Accepted

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