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 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(a * n)
# タクシーが安い
else:
    print(b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(A * N, B))

Submission status: Accepted

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

Submission status: Accepted

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

# N人*A円がB円より大きい場合
if N * A > B:
    print(B)
else:
    print(N * A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(a*n, b))

Submission status: Accepted

Solution code:
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())

train = N * A

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


train = N * A
taxi = B

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

print(min(n * a,b))

Submission status: Accepted

Solution code:
def main():
    n, a, b = map(int, input().split())
    print(min(n * a, b))
    # import sys
    # sys.setrecursionlimit = 10 ** 7
    # input = sys.stdin.readline
    # rstrip()
    # (int(x) - 1 for x in input().split())
    pass


if __name__ == '__main__':
    main()

# def binary_search(*, ok, ng, func):
#     while abs(ok - ng) > 1:
#         mid = (ok + ng) // 2
#         if func(mid):
#             ok = mid
#         else:
#             ng = mid
#     return ok

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def main():
    input = sys.stdin.buffer.readline
    n, a, b = map(int, input().split())
    print(min(n * a, b))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())


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

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

Submission status: Accepted

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

D =[]

den = N * A
D.append(den)

D.append(B)

D.sort()

print(D[0])

Submission status: Accepted

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

Submission status: Accepted

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

train = A * N
taxi = B

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

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

Submission status: Accepted

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

# 電車の料金
train = n * a
# タクシーの料金　b 円
taxi = b

print(min(train, taxi))

Submission status: Accepted

Solution code:
# n:n人
# 電車：1人あたりa円
# タクシー：n人でb円
n, a, b = map(int, input().split())

# 電車の場合
total = n * a

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

s = int(n*a)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ninzu, train, taxi = map(int, input().split())

train_fare = ninzu * train
minimum_fee = min(taxi, train_fare)

print(minimum_fee)

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

min_price = [train, taxi]
print(min(min_price))

Submission status: Accepted

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

if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - T or T
# https://atcoder.jp/contests/abc133/tasks/abc133_a

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

result = N * A

if result >= B:
    result = B

print(result)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 133a

def atc_133a(input_value: str) -> int:
    NAB = input_value.split(" ")
    N = int(NAB[0])
    A = int(NAB[1])
    B = int(NAB[2])

    return min(N * A, B)


input_value = input()
print(atc_133a(input_value))

Submission status: Accepted

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

print(min(N*A,B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 数値を取得
nop,train,taxi = map(int,input().split())

# 最安値を出力
trasum = train * nop
print(min(trasum,taxi))

Submission status: Accepted

Solution code:
# A - T or T

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

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
total_people, train_cost, taxi_cost = map(int, input().split())
if total_people * train_cost > taxi_cost:
    print(taxi_cost)
else:
    print(total_people * train_cost)

Submission status: Accepted

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

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

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=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:
# 133a
N,A,B=map(int,input().split())
if (1<=N&N<=20)&(1<=A&A<=50)&(1<=B&B<=50):
    train=A*N
    taxi=B
    print(min(train,taxi))

Submission status: Accepted

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

Submission status: Accepted

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

train = A * N
taxi = B

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

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:
# 1.値を正しく取得
a, b, c = (int(x) for x in input().split())

# 2.正しく処理
plan1 = a * b
plan2 = c

resalt=[plan1,plan2]

print(min(resalt))

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:
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 = (int(n) for n in 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:
man_num, train_price, taxi_price = map(int, input().split())

train_sum = man_num * train_price

if train_sum <= taxi_price:
    print(train_sum)
else:
    print(taxi_price)

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
taxi = B

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

Submission status: Accepted

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

# 私たちは N人で旅行しようとしており、その交通手段として電車とタクシーがあります。
# 電車を使うと 1人あたり A円かかります。
# タクシーを使うと N人で B円かかります。
# 全員の交通費の合計は最小でいくらになるでしょうか。

train = N * A
taxi = B

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

Submission status: Accepted

Solution code:
N,A,B=map(int,input().split(' '))
k=N*A
print(k) if B>=k 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(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 人で旅行しようとしており、
    その交通手段として電車とタクシーがあります。

    電車を使うと 1人あたり A円かかります。
    タクシーを使うと N人で B円かかります。

    全員の交通費の合計は最小でいくらになるでしょうか。
'''

'''
制約：
    入力は全て整数である。
    1 ≤ N ≤ 20
    1 ≤ A ≤ 50
    1 ≤ B ≤ 50
'''

# 標準入力から N, A, B の値を取得する
n, a, b = map(int, input().split())

# 合計の交通費を計算・比較し、最小の交通費を出力する
result = 0

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

print(result)

Submission status: Accepted

Solution code:
num_of_persons, train_per_price, taxi_total_price = map(int, input().split())
train_total_price = num_of_persons * train_per_price
print(min(taxi_total_price, train_total_price))

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(b,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

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


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

    print(min(A * N, B))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readlines

def main():
    lines = input()
    n, a, b = list(map(int, lines[0].split()))

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

    else:
        print(at)

main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readlines

def main():
    lines = input()
    n, a, b = list(map(int, lines[0].split()))

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

    else:
        print(at)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(A*N, B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def mapt(fn, *args):
    return list(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


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


main()

Submission status: Accepted

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

    ans = min(A * N, B)

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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









# import os
# import csv
# 
# stores_path = "店舗コード.csv"
# 
# with open(stores_path, encoding="cp932") as f:
#     reader = csv.reader(f)
#     for row in reader:
#         folder_name = row[0] + '_' + row[1]
#         if not os.path.exists(folder_name):
#             os.mkdir(folder_name)

Submission status: Accepted

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

train = A*N
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:
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:
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF =  float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

N, A, B = mapint()
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:
#! python3
#  solve_133A.py

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

print(min(A*N,B))

Submission status: Accepted

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

Submission status: Accepted

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

print(min(a*n,b))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# 問題：https://atcoder.jp/contests/abc126/tasks/abc133_a

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

res = n * a
if res > b:
    res = b

print(res)

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:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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

print(min(a*n,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:
from sys import stdin, stdout
from time import perf_counter

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

if check1<check2:
    print(check1)
else:
    print(check2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(B,N*A))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = list(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(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:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

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

print(min(n*a,b))

Submission status: Accepted

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

Submission status: Accepted

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

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:
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:
tmp = input().split(" ")
N = int(tmp[0])
A = int(tmp[1])
B = int(tmp[2])

print(min([N * A , B]))

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(n * a, b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():

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

    if N * A < B:
        ans = N * A

    else:
        ans = B

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# abc133_a.py
# https://atcoder.jp/contests/abc133/tasks/abc133_a

# A - T or T /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# 私たちは N人で旅行しようとしており、その交通手段として電車とタクシーがあります。
# 電車を使うと 1人あたり A円かかります。
# タクシーを使うと N人で B円かかります。
# 全員の交通費の合計は最小でいくらになるでしょうか。

# 制約
#     入力は全て整数である。
#     1≤N≤20
#     1≤A≤50
#     1≤B≤50

# 入力
# 入力は以下の形式で標準入力から与えられる。
# N A B

# 出力
# 最小の合計交通費を表す整数を出力せよ。

# 入力例 1
# 4 2 9

# 出力例 1
# 8

# 電車を使うと 4×2=8円かかり、タクシーを使うと 9 円かかるので、全員の交通費の合計の最小値は 8円です。

# 入力例 2
# 4 2 7

# 出力例 2
# 7

# 入力例 3
# 4 2 8

# 出力例 3
# 8


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    N, A, B = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(6):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(M):
    #     valueses.append(list(map(int, lines[i+1].split())))

    return [min(B, N*A)]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['4 2 9']
        lines_export = [8]
    if pattern == 2:
        lines_input = ['4 2 7']
        lines_export = [7]
    if pattern == 3:
        lines_input = ['4 2 8']
        lines_export = [8]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
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(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())
ans = N*A-B
if ans > 0:
  print(B)
else:
  print(N*A)

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

Submission status: Accepted

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

Submission status: Accepted

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