Problem:


Score : 100 points

Problem Statement

There are three airports A, B and C, and flights between each pair of airports in both directions.

A one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.

Consider a route where we start at one of the airports, fly to another airport and then fly to the other airport.

What is the minimum possible sum of the flight times?

Constraints

1 \leq P,Q,R \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

P Q R

Output

Print the minimum possible sum of the flight times.

Sample Input 1

1 3 4

Sample Output 1

4

The sum of the flight times in the route A \rightarrow B \rightarrow C: 1 + 3 = 4 hours

The sum of the flight times in the route A \rightarrow C \rightarrow C: 4 + 3 = 7 hours

The sum of the flight times in the route B \rightarrow A \rightarrow C: 1 + 4 = 5 hours

The sum of the flight times in the route B \rightarrow C \rightarrow A: 3 + 4 = 7 hours

The sum of the flight times in the route C \rightarrow A \rightarrow B: 4 + 1 = 5 hours

The sum of the flight times in the route C \rightarrow B \rightarrow A: 3 + 1 = 4 hours

The minimum of these is 4 hours.

Sample Input 2

3 2 3

Sample Output 2

5



Sample input:
1 3 4


Sample output:
4

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int, input().split())

list_m = [P+Q,R+Q,P+R,Q+R,R+P,Q+P]

min = 100
for i in range(0,len(list_m)):
    if min > int(list_m[i]):
        min = list_m[i]

print(min)

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int, input().split())

list_m = [P + Q,R + Q,P + R,Q + R,R + P,Q + P]

min = 100
for i in range(len(list_m)):
    if min > int(list_m[i]):
        min = list_m[i]

print(min)

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
print(sum(a)-min(a))

Submission status: Wrong Answer

Solution code:
#ABC129
p,q,r = map(int,input().split())
print(min(p+r,r+q))

Submission status: Wrong Answer

Solution code:
L=map(int,input().split())
print(min(sum(L)-v for v in L))

Submission status: Wrong Answer

Solution code:
P,Q,R=map(int,input().split())
count=300
for i in [P,Q,R]:
    for j in [P,Q,R]:
        if i==j:
         count=count
        else:
         if i+j<=count:
             count=i+j
print(count)

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int,input().split())
print(min(P + Q, Q + R))

Submission status: Wrong Answer

Solution code:
hours_p_distance, hours_q_distance, hours_r_distance = map(int, input().split())

root_p_q = hours_p_distance + hours_q_distance
root_p_r = hours_p_distance + hours_r_distance
root_q_r = hours_q_distance + hours_r_distance

print(min(root_p_q, root_q_r, root_q_r))

Submission status: Wrong Answer

Solution code:
x=list(map(int,input().split()))
sorted(x)
print(x[0]+x[1])

Submission status: Wrong Answer

Solution code:
i = list(map(int, input().split())) #i_1 i_2を取得し、iに値を入れる
i=(sorted(i,reverse=True))
print(i[0]+i[1])

Submission status: Wrong Answer

Solution code:
A,B,C = map (int, input ().split ())
if A>B>C or A>C>B:
  print (B+C)
elif B>A>C or B>C>A:
  print (A+C)
else:
  print (A+B)

Submission status: Wrong Answer

Solution code:
import sys

a = list(map(int,input().split()))
min = 100
for i in range(3):
  if min > a[i%3] + a[(i+1)%3]:
    min = a[i%3] + a[(i+1)%3]
print(min)

Submission status: Wrong Answer

Solution code:
p, q, r = map(int, input().split())
print(min(p+q, q+r, q+p))

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
import itertools

p,q,r = input().split()
p = int(p)
q = int(q)
r = int(r)
dest_min = p + q + r
dest = np.array(list(itertools.combinations([p,q,r],2)))
print(dest)

for dest_sample in dest:
    dest_min = min(dest_min, np.sum(dest_sample))

print(dest_min)

Submission status: Wrong Answer

Solution code:
p, q, r = map(int, input().split())
if p > q and p > r:
    print(q + r)
elif q > p and q > r:
    print(p + r)
else:
    print(p + q)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
x=a+b
if x>a+c:
	x=a+c
elif x>b+c:
	x=b+c
print (x)

Submission status: Wrong Answer

Solution code:
P,Q,R = map(int,input().split())
print(min(R+Q,Q+R,R+P))

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int, input().split(' '))
print(min([P+Q, Q+R]))

Submission status: Wrong Answer

Solution code:
p,q,r=map(int, input().split())
print(min(p+q,p+r,q,r))

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p>=q and  p>r:
    print(q+r)
if q>=p and q>r:
    print(p+r)
if r>=q and r>p:
    print(q+p)
if r==p and p==q:
    print(p+q)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p>=q and  p>r:
    print(q+r)
if q>=p and p>r:
    print(p+r)
if r>=q and r>p:
    print(q+p)
else:
    print(q+r)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<q+r and p+q<p+r:
    print(p+q)
if p+r<p+q and p+r<q+r:
    print(p+r)
if q+r<p+r and q+r<p+q:
    print(q+r)
if p+r==q+r and p+r<p+q:
    print(p+r)
if p+q==q+r and p+q<p+r:
    print(p+q)
if p+q==p+r and p+q<p+q:
    print(r+q)
if p==q==r:
    print(p+q)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<q+r and p+q<p+r:
    print(p+q)
if p+r<p+q and p+r<q+r:
    print(p+r)
if q+r<p+r and q+r<p+q:
    print(q+r)
if p+r==q+r and p+r<p+q:
    print(p+r)
if p+q==q+r and p+q<p+r:
    print(p+q)
if r+q==p+r and r+q<p+q:
    print(r+q)
if p==q==r:
    print(p+q)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<q+r and p+q<p+r:
    print(p+q)
if p+r<p+q and p+r<q+r:
    print(p+r)
if q+r<p+r and q+r<p+q:
    print(q+r)
if p+r==q+r and p+r<p+q:
    print(p+r)
if p+q==q+r and p+q<p+r:
    print(p+q)
if r+q==p+r and r+q>p+q:
    print(r+q)
if p==q==r:
    print(p+q)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<=q+r and p+q<p+r:
    print(p+q)
if p+r<=p+q and p+r<q+r:
    print(p+r)
if q+r<=p+r and q+r<p+q:
    print(q+r)
if p+r<=q+r and p+r<p+q:
    print(p+r)
if p==q==r:
    print(p+q)
if r+p==q+r and r+p>p+q:
    print(r+p)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<=q+r and p+q<p+r:
    print(p+q)
if p+r<p+q and p+r<q+r:
    print(p+r)
if q+r<=p+r and q+r<p+q:
    print(q+r)
if p+r==q+r and p+r<p+q:
    print(p+r)
if p==q==r:
    print(p+q)
if r+p==q+r and r+p>p+q:
    print(r+p)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<=q+r and p+q<p+r:
    print(p+q)
if p+r<=p+q and p+r<q+r:
    print(p+r)
if q+r<=p+r and q+r<p+q:
    print(q+r)
if p+r==q+r and p+r<p+q:
    print(p+r)
if p==q==r:
    print(p+q)
if r+p==q+r and r+p>p+q:
    print(r+p)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<=q+r and p+q<p+r:
    print(p+q)
if p+r<p+q and p+r<q+r:
    print(p+r)
if q+r<p+r and q+r<p+q:
    print(q+r)
if p+r==q+r and p+r<p+q:
    print(p+r)
if p==q==r:
    print(p+q)
if r+p==q+r and r+p>p+q:
    print(r+p)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<q+r and p+q<p+r:
    print(p+q)
if p+r<p+q and p+r<q+r:
    print(p+r)
if q+r<p+r and q+r<p+q:
    print(q+r)
if p+q==q+r and p+q<p+r:
    print(p+q)
if p+r==q+r and p+r<p+q:
    print(p+r)
if p==q==r:
    print(p+q)
if r+p==q+r and r+p>p+q:
    print(r+p)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<q+r and p+q<p+r:
    print(p+q)
if p+r<p+q and p+r<q+r:
    print(p+r)
if q+r<p+r and q+r<p+q:
    print(q+r)
if p+q==q+r and p+q<p+r:
    print(p+q)
if p+r==q+r and p+r<p+q:
    print(p+r)
if p==q==r:
    print(p+q)
if r+p==q+r and r+p<p+q:
    print(r+p)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<q+r and p+q<p+r:
    print(p+q)
if p+r<p+q and p+r<q+r:
    print(p+r)
if q+r<p+r and q+r<p+q:
    print(q+r)
if p+q==q+r and p+q<p+r:
    print(p+q)
if p+r==q+r and p+r<p+q:
    print(p+r)
if p==q==r:
    print(p+q)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<=q+r and p+q<=p+r:
    print(p+q)
if p+r<=p+q and p+r<=q+r:
    print(p+r)
if q+r<=p+r and q+r<=p+q:
    print(q+r)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
if p+q<q+r and p+q<p+r:
    print(p+q)
if p+r<p+q and p+r<q+r:
    print(p+r)
if q+r<p+r and q+r<p+q:
    print(q+r)

Submission status: Wrong Answer

Solution code:
l= list(map(int, input().split()))
l.sort
a=l[0]+l[1]
print (a)

Submission status: Wrong Answer

Solution code:
print(sum(sorted(list(map(int,input().split()))[:1])))

Submission status: Wrong Answer

Solution code:
print(sum(sorted(list(map(int,input().split()))[:2])))

Submission status: Wrong Answer

Solution code:
P,Q,R=map(int,input().split())

print(min(P+Q,Q+P,R+P))

Submission status: Wrong Answer

Solution code:
import heapq
pqr = list(map(int,input().split()))
sum(heapq.nlargest(2,pqr))

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
d = a + b
f = a + c
g = b + c
if d < f and d < g :
    print(d) 
elif f < d and f < g :
    print(f) 
elif g < f and g< d :
    print(d) 
elif d == f:
    print(d)
elif f == g:
    print(f)
elif g == d:
    print(g)

Submission status: Wrong Answer

Solution code:
p,q,r = map(int,input().split())
print(p + q + r)

Submission status: Wrong Answer

Solution code:
a,b,c = [int(a) for a in input().split()]
print(a+b)

Submission status: Wrong Answer

Solution code:
def main():
    p,q,r = map(int, input().split())
    min_time = min([p, q, r])
    print(min_time)

if __name__ == '__main__':
	main()

Submission status: Wrong Answer

Solution code:
sum(sorted(list(map(int, input().split())))[:2])

Submission status: Wrong Answer

Solution code:
try:
    n=list(map(int, input().strip().split()))
    lis1=[]
    for i in range(0,len(n)):
        for a in range(0,len(n)):
            z=(int(n[a])+int(n[i]))
            lis1.append(z)
    set1=set((lis1))
    lis1=list((set1))
    minscore='9999999999'
    for i in range(0,len(lis1)):
        if float(minscore)>float(lis1[i]):
            minscore=lis1[i]
    
    print(minscore)
    
except:
    print('')

Submission status: Wrong Answer

Solution code:
try:
    n=list(map(int, input().strip().split()))
    for i in range(0,len(n)):
        if int(n[i])<1 or int(n[i])>100:
            raise AssertionError

    lis1=[]
    for i in range(0,len(n)):
        for a in range(0,len(n)):
            if n[i]!=n[a]:
                z=(int(n[a])+int(n[i]))
                lis1.append(z)

    minscore='9999999999'
    for i in range(0,len(lis1)):
        if float(minscore)>float(lis1[i]):
            minscore=lis1[i]

    print(minscore)
except AssertionError:
    print('')

Submission status: Wrong Answer

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

lis1=[]
for i in range(0,len(n)):
    for a in range(0,len(n)):
        if n[i]!=n[a]:
            z=(int(n[a])+int(n[i]))
            lis1.append(z)

minscore='9999999999'
for i in range(0,len(lis1)):
    if float(minscore)>float(lis1[i]):
        minscore=lis1[i]

print(minscore)

Submission status: Wrong Answer

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

lis1=[]
for i in range(0,len(n)):
    for a in range(0,len(n)):
        if n[i]!=n[a]:
            z=(int(n[a])+int(n[i]))
            lis1.append(str(z))

minscore='9999999999'
for i in range(0,len(lis1)):
    if float(minscore)>float(lis1[i]):
        minscore=lis1[i]

print(minscore)

Submission status: Wrong Answer

Solution code:
try:
    n=list(map(int, input().strip().split()))

    lis1=[]
    for i in range(0,len(n)):
        for a in range(0,len(n)):
            if n[i]!=n[a]:
                z=int(n[a]+n[i])
                lis1.append(str(z))
               
    print(int(min(lis1)))
except:
    print('')

Submission status: Wrong Answer

Solution code:
try:
    n=list(map(int, input().strip().split()))

    lis1=[]
    for i in range(0,len(n)):
        for a in range(0,len(n)):
            if n[i]!=n[a]:
                z=int(n[a]+n[i])
                lis1.append(str(z))
               
    print(min(lis1))
except:
    print('')

Submission status: Wrong Answer

Solution code:
P = 2
Q = 3
R = 4

list1 = [P+Q, P+R, Q+P, Q+R, R+P, R+Q]
print(min(list1))

Submission status: Wrong Answer

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

print(max([p+q for p in ps for q in ps]))

Submission status: Wrong Answer

Solution code:
ais = map(int, raw_input().split(' '))
s = +float('inf')
for i in range(len(ais)): s = max(ais[i] + ais[(i+1) % len(ais)], s)
print s

Submission status: Wrong Answer

Solution code:
p, q, r = map(int, input().split())
print(min(p + q, p + r, r + p))

Submission status: Wrong Answer

Solution code:
p,q,r=list(map(int,input().split()))
print(min(p+q,q+r))

Submission status: Wrong Answer

Solution code:
P,Q,R=map(int,input().split())

a=[P,Q,R]

b=sorted(a)

print(a[0]+a[1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
p, q, r = map(int, input().split())
x = p + q
y = q + r
z = r + p

if x>=y and x>=z:
  print(x)
elif y>=x and y>=z:
  print(y)
else:
  print(z)

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int ,input().split())
print(max(P+Q, Q+R, R+P))

Submission status: Wrong Answer

Solution code:
p,q,r = map(int,input().split())

print(min(p+q,p+r,r*q))

Submission status: Wrong Answer

Solution code:
p,q,r = map(int, input().split())
ans = min(p+q,q+r,r+q)
print(ans)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
print(min(p+q,r))

Submission status: Wrong Answer

Solution code:
p, q, r = map(int, input().split())

print(min(p+q, q+r, r+q))

Submission status: Wrong Answer

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
l = LI()
print(l[0]+l[1])

Submission status: Wrong Answer

Solution code:
#A
p, q, r = map(int, input().split())
print(min(p+q,q+r,q+p))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# N = int(input())
# S = input()
P, Q, R = map(int, input().split())
# A = list(map(int, input().split()))

print(min(P + Q, R, P + R, Q + R, 2 * P + Q, 2 * Q + R))

Submission status: Wrong Answer

Solution code:
P,Q,R = map(int, input().split())
A = [P+Q, P+R, Q+R]
print(A)

Submission status: Wrong Answer

Solution code:
num_list = list(map(int, input().split()))
s_List = sorted(num_list)
print(num_list[0] + num_list[1])

Submission status: Wrong Answer

Solution code:
p, q, r = map(int, input().split())
if p + q < q + r:
    print(p + q)
else:
    print(q + r)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
n=[a,b,c]
d=[]
for i in range(1,len(n)):
  d.append(n[i]+n[i])
print(min(d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
S = input().rstrip()
N = int(input())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

# P, Q, R = map(int, input().split())
#
# heap = []
# heappush(heap, P * (-1))
# heappush(heap, Q * (-1))
# heappush(heap, R * (-1))
#
# heappop(heap)
#
# heap = list(map(lambda x: x * -1, heap))
# print(sum(heap))

A = list(map(int, input().split()))
sorted(A)
print(sum(A[:2]))

Submission status: Wrong Answer

Solution code:
p,q,r = map(int, input().split())
a = min(p,q,r)
print(p+q+r-a)

Submission status: Wrong Answer

Solution code:
P,Q,R = map(int,input().split())
a = P+Q
b = Q+R
c = P+R
if a<=b<=c or a<=c<=b:
    print(a)
elif b<=a<=c or b<=a<=c:
    print(b)
else:
    print(c)

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int, input().split())
print(min(P+Q, Q+R, R+Q))

Submission status: Wrong Answer

Solution code:
p,q,r = map(int, input().split())
s=[p+q,r+q,q+r]
S =sorted(s)
print(S[0])

Submission status: Wrong Answer

Solution code:
l = list(map(int, input().split()))
menor = 100
for i in range(len(l) - 1):
    if l[i+1] + l[i] < menor:
        menor = l[i+1] + l[i]
print(menor)

Submission status: Wrong Answer

Solution code:
linha = input()
menor = 101
segundoMenor = 101
for x in linha.split():
    if int(x) < menor:
        menor = int(x)
for x in linha.split():
    if int(x) == menor:
        pass
    elif int(x) < segundoMenor:
        segundoMenor = int(x)
print(menor + segundoMenor)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int, input().split())
print(max(P+Q, Q+R, R+P))

Submission status: Wrong Answer

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

ans = 10**1000
tmp = 0

for i in range(3):
    for j in range(i+1, 2):
        tmp = A[i] + A[j]
        ans = min(ans, tmp)

print(ans)

Submission status: Wrong Answer

Solution code:
p,q,r = map(int, input().split())
# p,q,r = map(int, "1 3 4".split())
print(r-q + r-p)

Submission status: Wrong Answer

Solution code:
p,q,r = map(int, input().split())

print(r-q + q-p)

Submission status: Wrong Answer

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

n[0]+=n[1]
n[1]+=n[2]
n[2]+=n[0]
print(min(n))

Submission status: Wrong Answer

Solution code:
PQR = list(map(int, input().split()))
PQR.sort
print(PQR)
print(PQR[0]+PQR[1])

Submission status: Wrong Answer

Solution code:
PQR = list(map(int, input().split()))
PQR.sort
print(sum(PQR[:-1]))

Submission status: Wrong Answer

Solution code:
a=list(map(int,input().split()))
a=sorted(a)
con=0
for i in range(1):
  con+=a[i]
  
print(con)

Submission status: Wrong Answer

Solution code:
# ABC 129: A – Airplane
p, q, r = map(int, input().split())
print(min(p + q, q + r, r + q))

Submission status: Wrong Answer

Solution code:
PQR=list(map(int,input().split()))
sorted(PQR)
print(PQR[1]+PQR[2])

Submission status: Wrong Answer

Solution code:
k=list(map(int,input().split()))
k.sort
print(int(k[0])+int(k[1]))

Submission status: Wrong Answer

Solution code:
k=list(map(int,input().split()))
k.sort
print(k[0]+k[1])

Submission status: Wrong Answer

Solution code:
k=list(map(int,input().split()))
k.sort
print(k[2]+k[1])

Submission status: Wrong Answer

Solution code:
P,Q,R = map(int,input().split())

print(P+Q+R-min(P,Q,R))

Submission status: Wrong Answer

Solution code:
P,Q,R=map(int,input().split())
ans=[]
ans.append(P)
ans.append(Q)
ans.append(R)

sorted(ans)
print(ans[0]+ans[1])

Submission status: Wrong Answer

Solution code:
P,Q,R = map(int,input().split())

if P + R <= P + Q and P + R <= R + Q:
   answer = P + R
elif P + Q <= P + R and P + Q <= R + Q:
	answer = P + Q
elif R + Q <= P + R and R + Q <= R + Q:
	answer = P + Q
  
print(answer)

Submission status: Wrong Answer

Solution code:
array = list(map(int, input().split()))
array.sort
print(sum(array[0:2]))

Submission status: Wrong Answer

Solution code:
ab , bc , ca = map(int , input(). split())
print(min(ab , ca) + bc)

Submission status: Wrong Answer

Solution code:
p,q,r = map(int,input().split())
print(min(p+q,q+r,r+q))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=open(0)
N,_,*a = map(int, a.read().split())

l,m = [0,0]
for i in range(1, N+1):
    if i in a:
        l,m = m,0
    elif i<3:
        l,m = m,m+1
    else:
        l,m = m,l+m%1000000007
print(m)

Submission status: Wrong Answer

Solution code:
p,q,r = map(int, input().split())

print(max(p+q,q+r,r+p))

Submission status: Wrong Answer

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

mn = 200
for i in range(2):
    for j in range(i+1,3):
        if (i+j < mn):
            mn = i+j

print(mn)

Submission status: Wrong Answer

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

mn = 200
for i in p[:-2]:
    for j in p[i+1:]:
        if (i+j < mn):
            mn = i+j

print(mn)

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int,input().split())
 
PQ = P + Q
QR = Q + R
RP = R + Q

temp1 = min(PQ, QR)
temp2 = min(temp1, RP)

print(temp2)

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
x=p+q
y=q+r
z=r+p
if(x<=y):
  if(x<=z):
    print(x)
elif(y<=z):
  if(y<=x):
    print(y)
elif(z<=x):
  if(z<=y):
    print(z)

Submission status: Wrong Answer

Solution code:
pqr = list(map(int,input().split()))
sorted(pqr)
print(sum(pqr[:2]))

Submission status: Wrong Answer

Solution code:
P,Q,R = list(map(int, input().split()))
print(min(P,Q)+min(Q,R))

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int, input().split())
List =[P+Q, Q+R, R+P]
List.sort
print(List[0])

Submission status: Wrong Answer

Solution code:
s = list(map(int,input().split()))
s.sort
set(s)
print(sum(s[:2]))

Submission status: Wrong Answer

Solution code:
s = list(map(int,input().split()))
s.sort
print(sum(s[:2]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = list(map(int, input().split()))
n = len(l)
d = 0
l.sort()
for i in range(0,n-1):
    d += l.pop(0)
    print(l)

print(d)

Submission status: Wrong Answer

Solution code:
A = [int(i) for i in input().split()]
print(A[0] + A[1])

Submission status: Wrong Answer

Solution code:
A = [int(i) for i in input().split()]
ans = 100
for i in range(3):
    for j in range(i + 1, 3):
        ans = min(ans, A[i] + A[j])
print(ans)

Submission status: Wrong Answer

Solution code:
o = input()
o_list = o.split(" ")

p = int(o_list[0])
q = int(o_list[1])
r = int(o_list[2])
pq = p + q
qr = q + r
rp = r + p

if pq <= qr and pq <= rp:
    print(pq)
elif qr <= rp and qr <= pq:
    print(pq)
elif rp <= pq and rp <= qr:
    print(rp)

Submission status: Wrong Answer

Solution code:
p,q,r = map(int,input().split())
print(min(p+q,q+r))

Submission status: Wrong Answer

Solution code:
p, q, r = map(int, input().split())

total = p + q + r

a = min(p, q, r)

print(total - a)

Submission status: Wrong Answer

Solution code:
import sys

def main():
    p, q, r = map(int, input().split())
    array = ([p,q,r])

    sorted(array, key=int)
    print(array[0] + array[1])

main()

Submission status: Wrong Answer

Solution code:
import sys

def main():
    p, q, r = map(int,input().split())
    array = ([p,q,r])

    sorted(array, key=int)
    print(array[0] + array[1])

main()

Submission status: Wrong Answer

Solution code:
import itertools

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

combos = itertools.combinations(routes,2)

time = []
for c in combos:
    time.append(c[0] + c[1])
    
min(time)

Submission status: Wrong Answer

Solution code:
N = input()
k = len(N)
mod = 10**9+7
DP = [[0,0] for i in range(k+1)]
DP[0][0] = 1
DP[0][1] = 0
for i in range(1,k+1):
    if N[i-1] == "1":
        DP[i][0] = (DP[i-1][0]*2)%mod
        DP[i][1] = (DP[i-1][1]*3+DP[i-1][0])%mod
    if N[i-1] == "0":
        DP[i][0] = DP[i-1][0]
        DP[i][1] = (DP[i-1][1]*3)%mod
print(DP[k][0]+DP[k][1])

Submission status: Wrong Answer

Solution code:
input()

Submission status: Wrong Answer

Solution code:
S = [ int(x) for x in input().split() ]
print( sum( S ) - min( S ) )

Submission status: Wrong Answer

Solution code:
p,q,r = map(int,input().split())

if p+q <= p+r or p+q <= q+r:
    print(p+q)

elif q+r <= p+q and q+r <= p+r:
    print(q+r)

elif p+r <= p+q and p+r <= q+r:
    print(p+r)

Submission status: Wrong Answer

Solution code:
p,q,r = map(int,input().split())

if p+q >= p+r or p+q >= q+r:
    print(p+q)

elif q+r >= p+q and q+r >= p+r:
    print(q+r)

elif p+r >= p+q and p+r >= q+r:
    print(p+r)

Submission status: Wrong Answer

Solution code:
p, q, r = map(int,input().split())
print(min(p+q, q+r, r+q))

Submission status: Wrong Answer

Solution code:
p,q,r= map(int,input().split())

a = min(p,q,r)

if(a == p):
    print(a+min(q,r))
elif(a == q):
    print(a+min(p,r))
elif(q == r):
    print(a+min(p,q))

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
print(min(p+q,q+r))

Submission status: Wrong Answer

Solution code:
p,q,r = map(int, input().split())

print(min(p+q,q+r))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int, input().split())

if (P + Q) >= (R + Q) and (P + Q) >= (R + P):
  print(P + Q)
elif (R + Q) >= (P + Q) and (R + Q) >= (R + P):
  print(R + Q)
elif (R + P) >= (P + Q) and (R + P) >= (P + Q):
  print(R + P)

Submission status: Wrong Answer

Solution code:
a=list(map(int,input().split()))
a.sort
print(sum(a[0:2]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())
print(max([p+q,q+r,r+p]))

Submission status: Wrong Answer

Solution code:
p,q,r=map(int,input().split())

li=[p+q,q+r+r+p]

li.sort()

print(li[0])

Submission status: Wrong Answer

Solution code:
P , Q , R = map(int, input().split())

if P > Q and P > R:
    print(Q + R)
elif Q > P and Q > R:
    print(P + R)
else:
    print(P + Q)

Submission status: Wrong Answer

Solution code:
P , Q , R = map(int, input().split())

if P > Q and P > R:
    print(Q + R)
if Q > P and Q > R:
    print(P + R)
else:
    print(P + Q)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter,defaultdict,deque
import sys,bisect,math,itertools,string,queue
from heapq import heappop, heappush
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

p = inpl()
p.sort
print(p[0]+p[1])

Submission status: Wrong Answer

Solution code:
y=input().split()
for i in range(len(y)):
    y[i]=int(y[i])
a=[]
a.append(y[0]+y[1])
a.append(y[2]+y[1])
a.append(y[0]+y[2])
a.sort()
print(a[1])

Submission status: Wrong Answer

Solution code:
p,q,r = map(int,input().split())
a = p+q
b = q+r
c = r+p
l=[a,b,c]
l.sort()
print(l[0]+l[1])

Submission status: Wrong Answer

Solution code:
p,q,r = map(int,input().split())
a = p+q
b = q+r
c = r+p
l=[a,b,c]
if max(l) == a:
  print(b+c)
elif max(l) == b:
  print(c+a)
else:
  print(a+b)

Submission status: Wrong Answer

Solution code:
L = list(map(int, input().split()))
L.sort()
print(sum(L[1:]))

Submission status: Wrong Answer

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

N.sort

print(N[0] + N[1])

Submission status: Wrong Answer

Solution code:
'''A - Airplane
https://atcoder.jp/contests/abc129/tasks/abc129_a

>>> main(1, 3, 4)
4
>>> main(3, 2, 3)
5
'''

from itertools import permutations


def main(p, q, r):
    _max = 100

    for p in permutations([p, q, r], 2):
        if _max > sum(p):
            _max = sum(p)

    print(_max)


if __name__ == '__main__':
    p, q, r = map(int, input().split(' '))
    main(p, q, r)

Submission status: Wrong Answer

Solution code:
a_L = list(map(int,input().split()))
sorted(a_L)
print(a_L[0]+a_L[1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
p,q,r = map(int, input().split())
print(p+q, min(q+r, r+p))

Submission status: Wrong Answer

Solution code:
p,q,r = map(int,input().split())

if 2*(p+q) < r:
    print(2*(p+q))
elif 2*(p+r) < q:
    print(2*(p+r))
elif 2*(r+q) < p:
    print(2*(r+q))
else:
    print(p+q+r)

Submission status: Wrong Answer

Solution code:
P,Q,R=[int(x) for x in input().split()]
print(max(P+Q,Q+R,R+P))

Submission status: Wrong Answer

Solution code:
p, q, r = map(int, input().split())
print(max(p+q, q+r, r+p))

Submission status: Wrong Answer

Solution code:
P, Q, R = map(int, input().split())
X = [P, Q, R]
X.pop()
print(sum(X))

Submission status: Wrong Answer

Solution code:
r_l=list(map(int,input().split()))
 
min_r=1000

for i in range(3):
  for j in range(i+1,3-1,1):
    min_r=min(r_l[i]+r_l[j],min_r)

print(min_r)

Submission status: Wrong Answer

Solution code:
p, q, r = map(int, input().split())
print(min(p+q, q+r, r+q))

Submission status: Wrong Answer

Solution code:
p, q, r = (int(x) for x in input().split(' '))
a = list()
a.append(p)
a.append(q)
a.append(r)

print(int(a[0]) + int(a[1]))

Submission status: Wrong Answer

Solution code:
p, q, r = input().split(' ')

a = sorted(list(p + q + r))

print(int(a[0]) + int(a[1]))

Submission status: Wrong Answer

Solution code:
PQR = list(map(int, input().split()))
PQR.sort()
print(int(sum(PQR[:1])))

Submission status: Wrong Answer

Solution code:
PQR = list(map(int, input().split()))
PQR.sort()
print(sum(PQR[:1]))

Submission status: Wrong Answer

Solution code:
p,q,r = map(int, input().split())
print(min(p+q, r))

Submission status: Wrong Answer

Solution code:
p,q,r = map(int, input().split())
print(max(p+q, r))

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
ab = a + b
ac = a + c
bc = b + c
if ab < ac and ab < bc:
  print(ab)
elif ac < ab and ac < bc:
  print(ac)
else:
  print(bc)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=list(map(int,input().split()))
a.sort
print(a[0]+a[1])

Submission status: Wrong Answer

Solution code:
p,q,r = map(int,input().split())
print(min(p,r)+q)

Submission status: Wrong Answer

Solution code:
p,q,r=[int(i) for i in input().split()]
print(min(p+q,q+r,q+r))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list(map(int,input().split()))
sum(sorted(s)[0:2])

Submission status: Wrong Answer

Solution code:
s = list(map(int,input().split()))
sum(sorted(s, reverse=True)[0:2])

Submission status: Wrong Answer

Solution code:
p, q, r = map(int,input().split())
print(min(p,q) + min(q,r))

Submission status: Wrong Answer

Solution code:
s=list(map(int,input().split()))
a=max(s)
b=min(s)
print(a+b)

Submission status: Wrong Answer

Solution code:
p, q, r = map(int, input().split())
print(min(p + q, q + r, r + q))