Problem:


Score : 100 points

Problem Statement

You are parking at a parking lot. You can choose from the following two fee plans:

Plan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours.

Plan 2: The fee will be B yen, regardless of the duration.

Find the minimum fee when you park for N hours.

Constraints

1≤N≤20

1≤A≤100

1≤B≤2000

All input values are integers.

Input

Input is given from Standard Input in the following format:

N A B

Output

When the minimum fee is x yen, print the value of x.

Sample Input 1

7 17 120

Sample Output 1

119

If you choose Plan 1, the fee will be 7×17=119 yen.

If you choose Plan 2, the fee will be 120 yen.

Thus, the minimum fee is 119 yen.

Sample Input 2

5 20 100

Sample Output 2

100

The fee might be the same in the two plans.

Sample Input 3

6 18 100

Sample Output 3

100



Sample input:
7 17 120


Sample output:
119

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bim/python
#! -*- coding: utf-8 -*-

nab = raw_input()
nab = nab.split()
n,a,b = map(int,nab)

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

Submission status: Accepted

Solution code:
def main():
    n,a,b=[int(i) for i in 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:
import sys

n, a, b = list(map(int, sys.stdin.readline().strip().split(" ")))
print(str(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,raw_input().split(' '))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
N, A, B = [int(i) for i in input().split()]
print(min(N*A, B))

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

plan1=A*N
plan2=B

if(plan1<plan2):
    print(plan1)
else:
    print(plan2)

Submission status: Accepted

Solution code:
num = [int(x) for x in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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(A*N,B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# d = defaultdict(lambda: 0)
# setrecursionlimit(10**7)
# inf = float("inf")


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

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



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

	print(min(n*a, b))

if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# cook your dish here
# from math import * 
#for _ in range(int(input().strip())):

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

Submission status: Accepted

Solution code:
# My code doesnt work, I have no idea why
# My code works, I have no idea why
n, a, b = [int(x) for x in input().split()]
ans1 = n*a 
ans2 = b
print(ans1 if ans1 <= ans2 else ans2)

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

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

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 -*-       

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

print(min(n*a,b))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding = SJIS

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

print(min(n * a), b)

Submission status: Runtime Error

Solution code:
class Imos:
    def __init__(self, n):
        self.B = [0] * n
        self.n = n
        from itertools import accumulate
        self.ac = accumulate

    def __call__(self, l, r):
        l, r = max(l, 0), min(r, self.n - 1)
        self.B[l] += 1
        if r + 1 != self.n:
            self.B[r + 1] -= 1

    def out(self):
        *res, = self.ac(self.B)
        return res

from collections import defaultdict
d = defaultdict(list)
imos = Imos(10 ** 5 + 1)

(N, C), *D = [[*map(int, o.split())] for o in open(0)]
for s, t, c in D:
    d[c] += (s, t),
for p in d.values():
    p.sort()
    ps, pt = p[0]
    for s, t in p[1:] + [[0,0]]:
        if pt == s:
            pt = t
        else:
            imos(ps, pt)
            ps, pt = s, t
print(max(imos.out()))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N=input()
print("No" if int(N) % sum(map(int, N)) else "Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
###==================================================
### import
#import bisect
#from collections import Counter, deque, defaultdict
#from copy import deepcopy
#from functools import reduce, lru_cache
#from heapq import heappush, heappop
#import itertools
#import math
#import string
import sys
### stdin
def input(): return sys.stdin.readline().rstrip()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]
### stdout
def OutH(lst, deli=' '): print(deli.join(map(str, lst)))
def OutV(lst): print('\n'.join(map(str, lst)))
### setting
sys.setrecursionlimit(10 ** 6)
### utils
int1 = lambda x: int(x) - 1
### constants
INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)
###---------------------------------------------------

N, A, B = iInM()

ans = min(A * N, B)

pritn(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# 1-index
from sys import stdin
import numpy as np
N,C = [int(x) for x in stdin.readline().rstrip().split()]
imos = [[0]*(10**5+2) for i in range(C+1)]
 
for i in range(N):
    s,t,c = [int(x) for x in stdin.readline().rstrip().split()]
    imos[c][s] += 1
    imos[c][t+1] -= 1
 
imos = np.array(imos)[:,:-1]
#print(np.cumsum(imos,axis=1))
ans = max(np.cumsum(imos,axis=1).sum(axis=0))
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,c=map(int,input().split())
table=[0]*220000
for i in range(n):
    a,s,c=map(int,input().split())
    table[2*a-1]+=1
    table[s*2]-=1
from itertools import accumulate
print(max(list(accumulate(table))))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,t,i=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(input(i))
c=min(x,i)

Submission status: Runtime Error

Solution code:
a,t=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(i)
c=min(x,i)

Submission status: Runtime Error

Solution code:
a,t,x=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(i)
c=min(x,i)

Submission status: Runtime Error

Solution code:
a,t,x=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(input())
c=min(x,i)

Submission status: Runtime Error

Solution code:
a,t,x=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(input(i))
c=min(x,i)

Submission status: Runtime Error

Solution code:
a,t=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(input(i))
c=min(x,i)

Submission status: Runtime Error

Solution code:
a,t=input().split()
a=int(a)
t=int(t)
x = a * t
i=int(input(i))
c=min(x,i)

Submission status: Runtime Error

Solution code:
a,t=input().split()
a=int(a)
t=int(t)
x = a * t
i=int(i)
c=min(x.i)

Submission status: Runtime Error

Solution code:
a,t=input().split()
a=int(a)
t=int(t)
x = a * t
i=int(i)
c=min(x,i)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
N, A, B = ri()
print(min(A * N, B))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
t,a,b=map(int,input());print((t*a,b)[t*a>b])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=float(input())
A=float(input())
B=float(input())
price1=A*N
price2=B
print(min(price1,price2))

Submission status: Runtime Error

Solution code:
n = input()
digitSum = 0
for digit in n:
    digitSum += int(digit)

print("Yes" if int(n) % digitSum == 0 else "No")

Submission status: Runtime Error

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

print(min(N*A,B))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=input()
cnt=0

for i in range(len(N)):
    cnt+=int(N[i])

if int(N)%cnt==0:
    print("Yes")
    
else:
    print("No")

Submission status: Runtime Error

Solution code:
n,c=map(int,input().split())
stc=[[int(i) for i in input().split()] for _ in range(n)]
dp=[0]*(2*10**5+2)
for s,t,c in stc:
  dp[2*s-1]+=1
  dp[2*t]-=1
for i in range(2*10**5):
  dp[i+1]+=dp[i]
print(max(dp))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input()

def digitsum(a):
  x = 0
  while a > 0:
    x += a % 10
    a /= 10
  return x

if N % digitsum(N) == 0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

tmp = list(input()).split()
val = [int(v) for v in tmp]
if val[0] * val[1] >= val[2]:
  ans = val[2]
  else:
    ans = val[0] * val[1]

Submission status: Runtime Error

Solution code:
n=int(input())
F=[[0]*10 for i in range(n)]
for i in range(n):
  F[i]=list(map(int,input().split()))
P=[[0]*11 for i in range(n)]
for i in range(n):
  P[i]=list(map(int,input().split()))
ans=-10**10
for i in range(1,1024):
  s=format(i,"12b")
  A=[]
  for j in range(10):
    if s[-1-j]=="1":
      A.append(j)
  p=0
  for j in range(n):
    c=sum(F[j][A[k]] for k in range(len(A)))
    p=p+P[j][c]
  if p>ans:
    ans=p
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())

total = 0
for i in range(1,n+1):
    total += N
    
    if N % sum(int(input())) == 0:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
F = [int(input().replace(' ',''), 2) for _ in range(n)]
P = [list(map(int, input().split())) for _ in range(n)]
ans=-10**7*n
for sp in range(1, 1033):
  total = 0
  for i in range(n):
    total += P[i][bin(F[i] & sp).count('1')]
  if total>ans:
    ans = total
  else:
    ans = ans
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = input()

wrk = 0
for i in n:
    wrk += int(i)

if int(n) % wrk == 0:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

print(min(N * A), B)

Submission status: Runtime Error

Solution code:
# bit全探索
N = int(input())
F = [list(map(int,input().split())) for _ in range(N)]
P = [list(map(int,input().split())) for _ in range(N)]
ans = -float('inf')
for i in range(2**10):
    if i == 0: # 全く営業しないパターン
        continue
    profit = 0
    pattern = [0]*10
    for j in range(10):
        if 1 << j & i:
            pattern[j] = 1
    #print(pattern)

    for k in range(N):
        l = sum([pattern[m] == F[k][m] == 1 for m in range(10)])
        # l = 0
        # for m in range(10):
        #     if pattern[m] == F[k][m] == 1:
        #         l += 1

        #print(l)
        profit += P[k][l]
    ans = max(ans,profit)
print(ans)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
N, A, B = [int(x) for x in input().split()]
print(min(A * T, B))

Submission status: Runtime Error

Solution code:
def main():
    input_string = list(map(int,input().split()))
    N = input_string[0]
    C = input_string[1]
    data = []
    max_time = 0
    for i in range(N):
        data.append(list(map(int,input().split())))
        max_num = max(data[i])
        if max_num>max_time:
            max_time=max_num

    #data_np = np.array(data).reshape(N,3)
    #data_np = np.array(data)

    #max_time = int(max(data))
    #print("max",max_time)
    schedule = [[0]*C for i in range(max_time)]
    #schedule = np.zeros([max_time,C])

    for i in range(N):
        start = data[i][0]-1
        end = data[i][1]-1
        channel = data[i][2]-1
        for j in range(end-start+1):
            if start+j-1<0:continue
            schedule[start+j-1][channel] = 1

#    for c in range(C):
#        for t in range(max_time):
#            if t==0:continue
#            if schedule[t][c]==1 and schedule[t-1][c]==0:
#                schedule[t-1][c]=1

    #max_N =0
    #for t in range(max_time):
    #    sum_of_ch = sum(schedule[t])

    temp = list(map(sum,list(schedule)))
    max_N = int(max(temp))


    #    if sum_of_ch>max_N:
    #        max_N = int(sum_of_ch)
    print(max_N)







main()

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import numpy as np

def main():
    input_string = list(map(int,input().split()))
    N = input_string[0]
    C = input_string[1]
    data = []
    for i in range(N):
        data.append(list(map(int,input().split())))

    data_np = np.array(data).reshape(N,3)

    max_time = max(data_np[:,1])
    schedule = np.zeros([max_time,C])

    for i in range(N):
        start = data[i][0]-1
        end = data[i][1]-1
        channel = data[i][2]-1
        for j in range(end-start+1):
            schedule[start+j][channel] = 1

    for c in range(C):
        for t in range(max_time):
            if t==0:continue
            if schedule[t][c]==1 and schedule[t-1][c]==0:
                schedule[t-1][c]=1

    max_N =0
    for t in range(max_time):
        sum_of_ch = sum(schedule[t])

        if sum_of_ch>max_N:
            max_N = int(sum_of_ch)
    print(max_N)







main()

Submission status: Runtime Error

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

    price1 = A*T
    price2 = B

    print(min(price1,price2))

main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,C=map(int,input().split())
f=[[0]*int(1e5) for _ in range(C)]

for i in range(N):
	s,t,c=map(int,input().split())
	f[c-1][s-1:t]=[1]*(t-s+1)

print(max(map(sum,zip(*f))))

Submission status: Runtime Error

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

NxA = (N*A)

if NxA =< B:
    print(NxA)
else:
    print(B)

Submission status: Runtime Error

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

NxA = (N*B)

if NxA =< B:
    print(NxA)
else:
    print(B)

Submission status: Runtime Error

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")

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

main()

Submission status: Runtime Error

Solution code:
N,C = map(int,input().split())
STC = []
for _ in range(N):
  s,t,c = map(int,input().split())
  STC.append([s,t,c])
STC.sort()

rs = [[STC[0][1],STC[0][2]]]
for i in range(1,N):
  len_rs = len(rs)
  
  min_idx = None
  for j in range(len_rs):
    if rs[j][1] != STC[i][2]: tmp_stc_r = STC[i][0] - 0.5
    else: tmp_stc_r = STC[i][0]
 
    if rs[j][0] <= tmp_stc_r:
      if min_idx is None: min_idx = j
      else:
        if rs[j][0] < rs[min_idx][0]: min_idx = j

  if min_idx is None: rs.append([STC[i][1], STC[i][2]])
  else: rs[min_idx] = [STC[i][1], STC[i][2]]
  
print(len(rs))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = input()
print('Yes') if int(n) % sum(map(int, n)) == 0 else print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from heapq import *
from itertools import accumulate as ac
n,c=map(int,input().split())
a=sorted([list(map(int,input().split()))for i in range(n)])
b=[[]for i in range(c+1)]
for i,j,h in a:
    if len(b[h])>0:
        if b[h][-1][1]==i:
            b[h][-1][1]=j
    else:
        b[h].append([i,j])
s=[0]*(2*10**5+2)
for i in b:
    for h,w in i:
        s[2*h-1]+=1
        s[2*w+1]-=1
print(max(list(ac(s))))

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline

N, C = map(int, input().split())

# 入力
lst = [[0] * (10 ** 5 + 10) for _ in range(C + 1)]

for _ in range(N):
    s, t, c = map(int, input().split())
    lst[c][s] += 1
    lst[c][t + 1] -= 1

#番組ごとに毎分必要かどうかを判断する
for i in range(1, C + 1):
    for j in range(1, 10 ** 5 + 10): #いもす法で計算
        lst[i][j] += lst[i][j - 1]
    for j in range(1, 10 ** 5 + 10): #重なっている時 = 連続して使う時
        lst[i][j] = min(1, lst[i][j])

for j in range(1, 10 ** 5 + 10):
    for i in range(1, C + 1):
        lst[i][j] += lst[i - 1][j]

print (max(lst[-1]))

Submission status: Runtime Error

Solution code:
t,a,b=int(input())
print(min(t*a,b))

Submission status: Runtime Error

Solution code:
#80

N, A, B = map(int, input().rstrip().split())
print(min(N*A, B)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(min(n * a, b))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print (ans)

Submission status: Runtime Error

Solution code:
N=int(input())
F=[]
P=[]
for _ in range(N):
    F.append(list(map(int,input().split())))
for _ in range(N):
    P.append(list(map(int,input().split())))

m=2**10
gain=-10**10
for i in range(1,2**10):
    x=list(map(int,format(i,'b').zfill(10)))
    sumP=0
    for j in range(N):
        total=sum([a*b for a,b in zip(x,F[j])])
        sumP+=P[j][total]
    gain=max(gain,sumP)
print(gain)

Submission status: Runtime Error

Solution code:
N = int(input())

N_str = str(N)
N_keta = []
N_sum = 0

for i in range(len(N_str)):
    N_keta.append(int(N_str[i]))
N_sum = sum(N_keta)

if N % N_sum == 0:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
N = int(input())

N_str = str(N)
N_keta = N_str[0] + N_str[1]
N_keta = int(N_keta)

if N_keta % N == 0:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import heapq

N,C=map(int, input().split())

inl = [tuple(map(int, input().split())) for i in range(N)]
inl.sort(reverse=True)

heap = []

res = 0


for i in range(1, 10001):
    nex = set([])
    rem = set([])

    con = 0
    while inl and inl[-1][0] == i:
        s,t,c = inl.pop()
        nex.add((s,c))
        heapq.heappush(heap, (t,c))

    while heap and heap[0][0] == i:
        t1,c1 = heapq.heappop(heap)
        rem.add((t1,c1))

    con = len(heap) + min(len(nex), len(rem))
    res = max(res, con)

print(res)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input()
sum = 0

for i in N:
    sum += int(i)
if int(N) % sum == 0:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;

int main(){
  int N,A,B;
  cin >> N>>A>>B;
  cout << min(A*N,B)<<endl;
}

Submission status: Runtime Error

Solution code:

l = list(map(int, input()))

p1 = l[0] * l[1]
p2 = l[2]

print(min(p1, p2))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,C = map(int,input().split())
tv_times = [[int(j) for j in input().split()] for i in range(N)]

channells = {}
for i in range(C+1):
    channells[i] = []
max_end = -1

for i in range(N):
    s,g,c = tv_times[i]
    max_end = max(max_end,g)
    channells[c] += [s,g]

tv_times = []
f = [0 for i in range(max_end+1)]
for cha in channells.keys():
    remove_list = []
    time = channells[cha]
    for i in range(len(time)//2-1):
        if time[2*i+1] == time[2*i+2]:
            remove_list.append(time[2*i+1])
    time = list(set(time)-set(remove_list))
    time.sort()
    # print(time)
    # print(time)
    # print(f)
    for i in range(len(time)//2):
        f[max(time[2*i]-1,0)] += 1
        f[time[2*i+1]] -= 1

ans = -1
for i in range(1,max_end):
    f[i] += f[i-1]
    if ans < f[i]:
        ans = f[i]

# print(f)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, C = map(int, input().split())
items = []
for i in range(N):
    items.append(tuple(map(int, input().split())))

times = [0] * 2 * (10 ** 5 + 1)
channel = [[0] * 2 * (10 ** 5 + 1) for _ in range(C)]
for i in range(N):
    s, t, c = items[i]
    c -= 1
    channel[c][2 * s - 1] += 1
    channel[c][2 * t] -= 1

for c in range(C):
    for i in range(len(times) - 1):
        channel[c][i + 1] += channel[c][i]
        if channel[c][i + 1] >= 1:
            times[i + 1] += 1

print(max(times))

Submission status: Runtime Error

Solution code:
n = int(input())

bits = []
for i in range(n):
  bit = int(input().replace(" ", ""), 2)
  bits.append(bit)
p = [[int(item) for item in input().split()] for _ in range(n)]

ans = - 10**9
for i in range(1,2**10):
  val = 0
  for j,mise in enumerate(p):
    val += mise[bin(i & bits[j]).count("1")]
  ans = max(ans, val)
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())

bits = []
for i in range(n):
  bit = int(input().replace(" ", ""), 2)
  bits.append(bit)
p = [[int(item) for item in input().split()] for _ in range(n)]

ans = - 10**9
for i in range(1,2**10):
  val = 0
  for j,mise in enumerate(p):
    val += mise[bin(i & bits[j]).count("1")]
    print(bin(i & bits[j]))
  ans = max(ans, val)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
temp = N
test = 0
while temp > 0:
  test += temp %10
  temp //= 10
if N % test == 0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
import numpy as np

n = int(input())
f = np.array([list(map(int, input().split())) for i in range(n)])
p = np.array([list(map(int, input().split())) for i in range(n)])

ans = -99999999

openptn=np.array([[int(s) for s in list('{0:010b}'.format(i))] for i in range(1,2**10)])

for i in range(2**10 - 1):
	subans = 0
	for j in range(n):
		count = sum(f[j]*openptn[i])
		print(f[j]*openptn[i])

		subans +=p[j][count]
        count = 0
		
		#print(subans)
	ans = max(ans, subans)

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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