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: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
code = input()
print('Good' if code[0] != code[1] and code[1] != code[2] and code[2] != code[3] else "Bad")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

train = n*a
taxi = n*b

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

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
x = [b * 4,c]
x.sort()
print(x[0])

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
x = [b,c]
x.sort()
print(a * x[0])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = 4
A = 12
B = 40

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    n, a, b = LI()
    print(min(n*a, b))

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
  n, a, b = LI()
  print(n*a, b)

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split());print([a*b,c][a*b<c])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(n*a+b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def man(N,A,B):
    train=N*A
    taxi=B
    if train<B:
        return train
    else:
        return taxi

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

elif n*a < b:
    print(b)

Submission status: Wrong Answer

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

c=n*a

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

Submission status: Wrong Answer

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, groupby
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

train=(N*A)
taxi=(N//B)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
inputted = list(map(int, input().split()))
N = inputted[0]
A = inputted[1]
B = inputted[2]

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

print(amount)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Aans = A*B

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

print(max(N * A, B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
N,A,B=map(int,input().split())
if N*B>A:
    print(A)
else:
    print(N*B)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
N,A,B=map(int,input().split())
if N*B>A:
    print(N*B)
else:
    print(A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(A*N + B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n,a,b=INTM()
    print(n*a,b)
if __name__ == '__main__':
    do()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(min(A,N/B))

Submission status: Wrong Answer

Solution code:
# 21:05
N ,A ,B = map(int, input().split())
print(max(N*A,B))

Submission status: Wrong Answer

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

print(max(n*a,b))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(min(a*b, a*c))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

result = N*A
print(result if N*A > B else B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
li = list(map(int,stdin.readline().rstrip().split()))
if li[1] > li[2]:
    print(li[0]*li[2])
else:
    print(li[0]*li[1])

Submission status: Wrong Answer

Solution code:
array = input().split()
array = tuple(array)

count = int(array[0])
train_fare = int(array[1])
taxi_fare = int(array[2])

total_taxi_fare = taxi_fare * count


if (total_taxi_fare <= taxi_fare):
    print(total_taxi_fare)
elif (taxi_fare >= train_fare):
    print(train_fare)

Submission status: Wrong Answer

Solution code:
array = input().split()
array = tuple(array)

count = int(array[0])
train_fare = int(array[1])
taxi_fare = int(array[2])

total_taxi_fare = taxi_fare * count


if (total_taxi_fare >= taxi_fare):
    print(total_taxi_fare)
elif (taxi_fare >= train_fare):
    print(train_fare)

Submission status: Wrong Answer

Solution code:
array = input().split()
array = tuple(array)

count = int(array[0])
train_fare = int(array[1])
taxi_fare = int(array[2])


if (train_fare >= taxi_fare):
    print(taxi_fare * count)
elif (taxi_fare >= train_fare):
    print(train_fare * count)

Submission status: Wrong Answer

Solution code:
array = input().split()
array = tuple(array)

count = int(array[0])
train_fare = int(array[1])
taxi_fare = int(array[2])


if (train_fare >= taxi_fare):
    print(taxi_fare * count)
else:
    print(train_fare * count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(max(int(N*A),B))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin; input=stdin.readline
n,a,b=map(int,input().split())
print(n*min(a,b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
List = list(map(int,input().split()))
N = List[0]
A = List[1]
B = List[2]

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

Submission status: Wrong Answer

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

Tr = N * A
Tx = N * B
print(min(Tr,Tx))

Submission status: Wrong Answer

Solution code:

n = input()

N = int(n.split()[0])
A = int(n.split()[1])
B = int(n.split()[2])

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

else:
    print(int(A*N))

Submission status: Wrong Answer

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

y=[0]*3
y[0]=int(x[0])
y[1]=int(x[1])
y[2]=int(x[2])

print(min(y[0]*y[1],y[0]*y[2]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(max(A*N,B))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
n,a,b = list(map(int, input().split()))
d = n*a
t = n*b
print(int(np.min([d, t])))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

b *= n

print(min(a, b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

tak = int(a) * int(b)
rail = int(c)

if tak > rail: 
	print( "%d" % tak )
else :
  	print( "%d" % rail )

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

#print('n: ', n)
#print('a: ', a)
#print('b ', b)

fare_taxy = int(b)
fare_bus = int(a) * int(n)

if fare_taxy < fare_bus:
    print(fare_taxy)
else:
    print(fare_bus)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(max(n*a, b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from copy import *
from sys import *
import math
import queue
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)

#dp[i][j]: iまでからj枚えらんで和がkになるのは何通り
def main():
	n,a,b = map(int,input().split())
	print(b if b>n*a else n*a)

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(m,n):
	x = max(m,n)
	y = min(m,n)
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	return y

class queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i = input().split(" ")
people = int(i[0])
train_fee = int(i[1])
taxi_fee = int(i[2])

train_sum = people * train_fee
if train_sum > taxi_fee:
    print(train_sum)
else:
    print(taxi_fee)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
n,a,b = map(int,input().split())
if n%4 == 0:
    k = n//4
else:
    k = n//4+1
        

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python

def main():
    N, A, B = list(map(int, input().strip().split()))
    if N * A < B:
        print(N * A)
    else:
        print(B)

Submission status: Wrong Answer

Solution code:
print("hello world!!")

Submission status: Wrong Answer

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

train = a * b
taxi = a * c

so_small = min(train, taxi)
print(so_small)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main(n,a,b):
    if (1 <= n <= 20 )and (1 <= a <= 50) and (1 <= b <= 50) :
        sum_list = [(n-x)*b + x * a for x in range(1,n+1)]
    return min(sum_list)

if __name__ == '__main__':
    s = list(map(int, input().split()))
    huga = main(s[0],s[1],s[2])
    print(huga)

Submission status: Wrong Answer

Solution code:
def main(n,a,b):
    sum_list = [(n-x)*b + x * a for x in range(1,20)]
    return min(sum_list)

if __name__ == '__main__':
    s = list(map(int, input().split()))
    huga = main(s[0],s[1],s[2])
    print(huga)

Submission status: Wrong Answer

Solution code:
def main(n,a,b):
    sum_list = [(n-x)*b + x * a for x in range(1,20)]
    return min(sum_list)

if __name__ == '__main__':
    s = list(map(int, input().split()))
    main(s[0],s[1],s[2])

Submission status: Wrong Answer

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

print(min(n, a*b))

Submission status: Wrong Answer

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

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