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:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

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

Submission status: Accepted

Solution code:
a,b,c= input().split()
x,y,z=(int(a),int(b),int(c))
total_train = x*y
total_taxi=z
print(min([total_train, total_taxi]))

Submission status: Accepted

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

print(min(tra, b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    n, a, b = input_nums()
    if n * a > b:
        print(b)
    else:
        print(n * a)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Aans = A*N

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

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

Submission status: Accepted

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


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


# Generated by 1.1.6 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:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.6 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())
print(min(n*a, b))

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:
N,A,B=[int(x) for x in input().rstrip().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( 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:
a,b,c = [int(i) for i in input().split()]
print(min(a*b, c))

Submission status: Accepted

Solution code:
#A
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(train)
else:
    print(b)

Submission status: Accepted

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

Submission status: Accepted

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

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

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 A * N <= B:
    ans = A * N
else:
    ans = B

print(ans)

Submission status: Accepted

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

print(min(n*a,b))

Submission status: Accepted

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

train = N * A
taxi = B
print(min(train, taxi))

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:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import scipy as scp

# 入力の受け取り
n,a,b = map(int,input().split())

ans = min(n*a,b)

print(ans)
# print("{:.10f}".format(ans))
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(a * n, b))

Submission status: Accepted

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

x = n * a
y = b
print(min(x,y))

Submission status: Accepted

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

tmp_1 = a*n

tmp_2 = b

if tmp_1 >= tmp_2:
    print(tmp_2)
else:
    print(tmp_1)

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 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())
print(min(B,N*A))

Submission status: Accepted

Solution code:
def solve():
    N, M, L = map(int, input().split())
    return min(N*M,L)

print(solve())

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(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:
# ABC133 A

def main():
    n, a, b = map(int, input().split())
    
    train = n * a
    taxi = b

    print(min(train, taxi))

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

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

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())
print(a*n if a*n<b else 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())
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:
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:
#!/usr/bin/env python3
import sys

# Generated by 1.1.6 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():
    N,A,B = [int(s) for s in input().split()]
    print(B) if B <= A*N else print(A*N)

if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

Solution code:
import os, sys, re, math

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

print(min(N * A, B))

Submission status: Accepted

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

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

print(min(l))

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

Submission status: Accepted

Solution code:
# Problem A - T or T

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

train = N * A
taxi = B

print(min(train, taxi))

Submission status: Accepted

Solution code:
# A - T or T
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(b if b< n*a else n*a)

Submission status: Accepted

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

Submission status: Accepted

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

n, a, b = (int(x) for x in stdin.readline().rstrip().split())
print(n*a if n*a <= b else b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
stdin = input().split(" ")
N = int(stdin[0])
A = int(stdin[1])
B = int(stdin[2])

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

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

Submission status: Accepted

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

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

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 math
#import bisect
#import numpy as np
#import itertools
#import copy
import sys

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

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

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

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

Submission status: Accepted

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

print(min(N * A, B))

Submission status: Accepted

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

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

if __name__=='__main__':
  main()

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

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

print(min(c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
number = input().split(" ")
N = int(number[0])
A = int(number[1])
B = int(number[2])
if N * A >= B:
	print(B)
else:
	print(N * A)

Submission status: Accepted

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

MIN = min(N*A, B)

print(MIN)

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

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

train = n * a
tax = b

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

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
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue
import itertools

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

Submission status: Accepted

Solution code:
# ABC133 A - T or T
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())

i = n*a

if i >= b:
    print(b)
elif i < b:
    print(i)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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())
a=n*a
if(a<=b):
  print(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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, A, B = MAP()

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

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ == '__main__':
    ans = main()
    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:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc133/tasks/abc133_a

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

Submission status: Accepted

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

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:
# Code for A - T or T

[n, a, b] = raw_input().split()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print("{}".format(n*a if n*a<b else b))

Submission status: Accepted

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

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

train = N * A
taxy = B

print(min([train,taxy]))

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

n,a,b = get_nums_l()

print(min(n*a, b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import itertools
# import math

import sys
input = sys.stdin.readline


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


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

# P = []
# S = []
# for i in range(N):
#     pp, ss = map(int, input().split())
#     P.append(pp)
#     S.append(ss)

print(solve(N, A, B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
import sys
row = sys.stdin.readline
def read_ints(row):
    return list(map(int, row().split()))
  
X,A,B = read_ints(row)
print(min(X*A, B))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n, a, b = map(int, input().split())
 
    train = n * a
    taxi = b
 
    print(min(train,taxi))
 
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:
    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:
a,b,c=map(int,input().split())
d=a*b
if d>=c:
  print(c)
else:
  print(d)

Submission status: Accepted

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

if __name__=="__main__":
    main()

Submission status: Accepted

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

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

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

input = sys.stdin.readline


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


# Run main
if __name__ == '__main__':
    Solution().main()

Submission status: Accepted

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

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N, A, B = map(int, read().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(' '))

train = N * A
taxi = B

print(min(taxi, train))

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N, A, M = map(int, input().split(" "))
    print(min(N * A, M))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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