Problem:


Score : 200 points

Problem Statement

In some other world, today is the day before Christmas Eve.

Mr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \leq i \leq N) is p_i yen (the currency of Japan).

He has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay?

Constraints

2 \leq N \leq 10

100 \leq p_i \leq 10000

p_i is an even number.

Input

Input is given from Standard Input in the following format:

N
p_1
p_2
:
p_N

Output

Print the total amount Mr. Takaha will pay.

Sample Input 1

3
4980
7980
6980

Sample Output 1

15950

The 7980-yen item gets the discount and the total is 4980 + 7980 / 2 + 6980 = 15950 yen.

Note that outputs such as 15950.0 will be judged as Wrong Answer.

Sample Input 2

4
4320
4320
4320
4320

Sample Output 2

15120

Only one of the four items gets the discount and the total is 4320 / 2 + 4320 + 4320 + 4320 = 15120 yen.



Sample input:
3
4980
7980
6980


Sample output:
15950

Submission status: Wrong Answer

Solution code:
n = int(input())
p=list(map(int,input().split()))
p1=int(max(p)/2)

print(sum(p)-max(p)+p1)

Submission status: Wrong Answer

Solution code:
n = int(input())
p=list(map(int,input().split()))
p1=int(max(p)//2)

print(sum(p)-max(p)+p1)

Submission status: Wrong Answer

Solution code:
N = int(input())
P = list (map(int,input().split()))
a = max(P)
P.remove(a)
s = 0
for i in P:
    s += i
print(s + a//2)

Submission status: Wrong Answer

Solution code:
n, *a = map(int, open(0).read().split())
print(sum(a) - sorted(a)[-1])

Submission status: Wrong Answer

Solution code:
# coding: utf-8

num = int(input())
table = []
total = 0
for i in range(num):
    table.append(int(input()))
print(table)
list.sort(table)
total += table[num-1] / 2
for i in range(num-1):
    total += table[i]
print(int(total))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
p = []
for i in range(n):
    p.append(int(input()))
print(p)
print(sum(p)-max(p)//2)

Submission status: Wrong Answer

Solution code:
k=0
max=0
N=int(input())
for i in range(1,N+1):
    p=int(input())
    if p>max:max=p
    k=k+p
    print((k-max)+(max//2))

Submission status: Wrong Answer

Solution code:
max=0
k=0
N=int(input())
for i in range(1,N+1):
    p=int(input())
    if p>max:max=p
    k=k+p
    print((k-max)+(max//2))

Submission status: Wrong Answer

Solution code:
n = int(input())

a = [int(input()) for i in range(n)]

b = []
for i in a:
    if i == max(a):
        b.append(i/2)
    else:
        b.append(i)

print(int(sum(b)))

Submission status: Wrong Answer

Solution code:
N = int(input())
i = 0
goods = []
while i < N:
    goods.append(int(input()))
    i += 1
print(sum(goods))
print(max(goods))
print(max(goods) // 2)
ans = sum(goods) - max(goods) + (max(goods) // 2)
print(ans)

Submission status: Wrong Answer

Solution code:
max = 0
s = 0
n = int(input())
for i in range(1, n + 1):
    p = int(input())
    if max < p:
        max = p
        s = s + max
print(s + max // 2)

Submission status: Wrong Answer

Solution code:
Row = int(input())
List = []
for i in range (Row):
  List.append(int(input()))
List.sort()
List[Row-1] = List[Row-1]//2
for i in range (Row):
  res = List[i]
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
p = [int(i) for i in input().split()]
print(sum(p) - (max(p) // 2))

Submission status: Wrong Answer

Solution code:
N = int(input())
p = [int(input()) for _ in range(N)]
max_p = max(p)
max_index = p.index(max_p)

sum = 0
for i in range(N):
    if i == max_index:
        sum += p[i]/2
    else:
        sum += p[i]
print(sum)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input()) for i in range(n)]
print(sum(p)-(max(p)/2))

Submission status: Wrong Answer

Solution code:
N=int(input())
X=[]
for i in range(N):
  X.append(int(input()))
A=sorted(X)
ans = 0
for i in range(N-1):
  ans += X[i]
ans += X[N-1]//2
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A=[]
for i in range(N):
    A += [int(input())]

A.sort()
print(sum(A) - A[-1]/2)

Submission status: Wrong Answer

Solution code:
l = [int(input()) for i in range(int(input()))]
print(sum(l) + max(l) // 2)

Submission status: Wrong Answer

Solution code:
N = int(input())
p = sorted([int(input()) for i in range(N)])
print(p)
p[N - 1] = p[N - 1] // 2
print(sum(p))

Submission status: Wrong Answer

Solution code:
n = int(input())
p = [int(input()) for i in range(n)]
print(sum(p) - max(p) / 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import sys

input = iter(sys.stdin.read().splitlines()).__next__

N = int(input())
P = []
for i in range(N):
   P.append(int(input()))


P.sort()
print(P)

res = sum(P[:-1]) + P[-1]//2

print(res)

Submission status: Wrong Answer

Solution code:
N = int(input())
list = [int(input()) for i in range(N)]
print(sum(list)-(max(list)/2))

Submission status: Wrong Answer

Solution code:
N = int(input())
list = [int(input()) for i in range(N)]
print(sum(list)-(list[-1]/2))

Submission status: Wrong Answer

Solution code:
p=[int(input()) for _ in range(int(input()))]
print(sum(p)-max(p)/2)

Submission status: Wrong Answer

Solution code:
p=[int(input()) for _ in range(int(input()))]
print(sum(p)+max(p)/2)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input()) for i in range(n)]
print(sum(p)+max(p)//2)

Submission status: Wrong Answer

Solution code:
N=int(input())
p=sorted([int(input()) for i in range(N)])[::-1]

Sum=p[0]/2

for i in range(1,N):
  Sum=Sum+p[i]

print(Sum)

Submission status: Wrong Answer

Solution code:
n = int(input(0))
p = [int(input()) for _ in range(n)]
print(sum(p) - max(p)//2)

Submission status: Wrong Answer

Solution code:
N = int(input())
l = sorted([int(input()) for _ in range(N)])

s = int(sum(l[0:-2]) + l[-1]/2)
print(s)

Submission status: Wrong Answer

Solution code:
N = int(input())
List = [int(input()) for _ in range(N)]
last = sorted(List)[-1] * 0.5
print(sum(List) - last)

Submission status: Wrong Answer

Solution code:
N = int(input())
List = [int(input()) for _ in range(N)]
last = sorted(List)[-1] * 0.1
print(sum(List) - last)

Submission status: Wrong Answer

Solution code:
N = int(input())
p = []
for i in range(N):
  pi = [int(input())]
  p = p + pi
  
M = max(p)

print(sum(p)-M/2)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(input()) for i in range(n)]
h = max(a)
print(sum(a)-h+h/2)

Submission status: Wrong Answer

Solution code:
def bChristmas(n, pl):

    return sum(pl) - (max(pl)/ 2)

def main():
    n = int(input())
    pl = [int(input()) for i in range(n)]
    print(bChristmas(n, pl))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
d = int(input())
x = "Christmas"
y = "Eve"
if d == 25:
    print(x)
elif d == 24:
    print("{} {}".format(x, y))
elif d == 23:
    print("{} {} {}".format(x, y, y))
else:
    print("{} {} {} {}".format(x, y, y, y))

Submission status: Wrong Answer

Solution code:
p=[int(input()) for _ in range(int(input()))]
ans=0
for i in range(len(p)):
    ans+=p[i]
ans=ans-max(p)+max(p)/2
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
num = N+1
pre = 1
for i in range(1,num):
  total = i * pre
  pre = total % (10 ** 9 + 7)
else:
  print(pre)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n):
    a =input()
    l.append(int(a))
lm=sorted(l)
lm2=l[0:n]
b=l[-1]
print(sum(lm2)+int(b//2)-int(b))

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n):
    a =input()
    l.append(int(a))
lm=sorted(l)
lm2=l[0:n-1]
b=l[-1]
print(sum(lm2)+int(b//2))

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n):
    a =input()
    l.append(int(a))
print(sum((l)))

Submission status: Wrong Answer

Solution code:
n =int(input())
p =[]
for i in range(n):
    a =int(input())
    p.append(a)
p.sort()
new_p =p[n-1]/2
ans =sum(p[:n-1])+new_p
print(new_p)
print(int(ans))

Submission status: Wrong Answer

Solution code:
S = input()
if S[0] != 'A':
    print('WA')
    exit()
if S[2:].count('C') != 1:
    print('WA')
    exit()
for i in range(len(S)):
    if i in [0, 2]:
        if S[i] != S[i].upper():
            print('WA')
            exit()
        continue
    if S[i] != S[i].lower():
        print('WA')
        exit()
print('AC')

Submission status: Wrong Answer

Solution code:
N = int(input("個数を入力してください:"))
p = [int(input("金額を入力してください:")) for i in range(N)]
print(sum(p)-max(p)//2)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(input()) for i in range(n)]
print(sum(a)-max(a)/2)

Submission status: Wrong Answer

Solution code:
import sys
import math

input()
a = []
for l in sys.stdin:
    a.append(int(l))

print(a)

b = sorted(a, reverse=True)
print(b)

counter = 0
i2 = 0
for i in b:
    if counter == 0:
        i2 = i / 2 + i2
    else:
        i2 = i2 + i
    counter += 1
print(math.floor(i2))

Submission status: Wrong Answer

Solution code:
import sys


input()
a = []
for l in sys.stdin:
    a.append(int(l))
    
    
print(a)

b = sorted(a,reverse=True)
print(b)

counter = 0
i2 = 0
for i in b:
    if counter == 0:
      i2 = i/2 + i2
    else:
      i2 = i2 + i
    counter +=1
print(i2)

Submission status: Wrong Answer

Solution code:
N=int(input())
p=[]
for _ in range(N):
  p.append(int(input()))

p.sort()
ans=0
for i in range(N):
  if i==0:
    ans+=p[i]//2
  else:
    ans+=p[i]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
p = [int(input()) for i in range(n)]
print(sum(p)-max(p)/2)

Submission status: Wrong Answer

Solution code:
N = int(input())
P = [int(input()) for i in range(N)]
sum = 0

for i in range(N):
  if P[i] == max(P):
    sum += P[i] // 2
  else:
    sum += P[i]

print(sum)

Submission status: Wrong Answer

Solution code:
n = int(input())
p = [int(input()) for i in range(n)]

m = max(p)/2

sum = 0

for i in p:
  sum += i
ans = sum - m

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=list(map(int,input().split()))
print(sum(p)-max(p)//2)

Submission status: Wrong Answer

Solution code:
n = int(input())
ls = [int(input()) for i in range(n)]
list.sort(ls,reverse=True)
ls[0] = ls[0]/2
a = 0
for i in range(n):
    a += ls[i]
print(a)

Submission status: Wrong Answer

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = int(sys.stdin.readline().rstrip())
    P = [int(sys.stdin.readline().rstrip()) for i in range(N)]

    print(sum(P) - max(P) / 2)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
P = sorted(int(input()) for _ in range(n))
P[-1] /= 2
print(sum(P))

Submission status: Wrong Answer

Solution code:
n=int(input())
m=0
s=0
for i in range(n):
    p=int(input())
    s+=p
    m=max(m,p)
print(s-(m/2))

Submission status: Wrong Answer

Solution code:
n = int(input())

p = [int(i) for i in input().split()]

p.sort(reverse=True)

max = p[0]
els = p[1:]

print(sum(els) + (max/2))

Submission status: Wrong Answer

Solution code:
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
print(l[0]//2+sum(l[1:]))

Submission status: Wrong Answer

Solution code:
N=int(input())
p_list=[int(input()) for i in range(N)]
s=sorted(p_list)
print(sum(s[:N-1])+s[N-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
list=[]
for i in range(N):
    list.append(i)
print(int(sum(list))-max(list)//2)

Submission status: Wrong Answer

Solution code:
N = int(input())
list=[]
for i in range(N):
    list.append(i)
print(sum(list)-max(list)//2)

Submission status: Wrong Answer

Solution code:
p=[int(input()) for i in range(int(input()))]
num=sorted(p,reverse=True)
print(num)
print(int(num[0]/2+sum(num[1::])))

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [int(input()) for _ in range(n)]
print(sum(l)-max(l)/2)

Submission status: Wrong Answer

Solution code:
N=int(input())
p=list(map(int,input().split()))
print(sum(p)-max(p)//2)

Submission status: Wrong Answer

Solution code:
N=int(input())
p=list(map(int,input().split()))
p=sorted(p,reverse=True)
ans=int(p[0]/2)
for i in range(1,len(p)):
    ans+=p[i]
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
List = [int(input()) for i in range(N)]
print(sum(List)-(max(List)/2))

Submission status: Wrong Answer

Solution code:
l=[int(input()) for _ in range(int(input()))]
print(sum(l)-max(l)/2)

Submission status: Wrong Answer

Solution code:
N=int(input())
n=[int(input()) for i in range(N)]
print(sum(n)-max(n)/2)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input()) for i in range(n)]
f=max(p)
ans=sum(p)-f+(f//2)

Submission status: Wrong Answer

Solution code:
N = int(input())
p = [int(input()) for _ in range(N)]
print(sum(p) - max(p)/2)

Submission status: Wrong Answer

Solution code:
N = int(input())
price_list = []
append = price_list.append
for i in range(N):
    p = int(input())
    append(p)
price_list.sort(reverse=True)
price_list[0] = price_list[0] / 2
print(sum(price_list))

Submission status: Wrong Answer

Solution code:
N = int(input())
p_list = [0]*10
i = 0
for i in range(N):
    x = int(input())
    p_list[i] = x
    x = 0


print(p_list)
p_list.sort()
print(p_list)
kari = sum(p_list)
print(int(kari - (p_list[-1]/2)))

Submission status: Wrong Answer

Solution code:
a,*n=map(int,open(0));print(sum(n)-max(n)/2)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
for i in range(n):
  a.append(i)
a.sort()
print(sum(a)-a[-1]//2)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input()) for i in range(n)]
q=max(p)
print(int(sum(p))-int(q)/2)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input()) for i in range(n)]
q=max(p)
print(int(sum(p))-max(p)/2)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input()) for i in range(n)]
q=max(p)
print(sum(p)-q+q/2)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input()) for i in range(n)]
q=max(p)
print(sum(p)-max(p)/2)

Submission status: Wrong Answer

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
n=int(input())
p=[int(input()) for i in range(n)]
ans=0
print(sum(p)-max(p)/2)

Submission status: Wrong Answer

Solution code:
banig = []
for x in range(int(input())):
  banig.append(int(input()))

sum = 0
big = max(banig)
banig.remove(big)
summation = 0
for e in banig:
  summation += e
print(summation + big/2)

Submission status: Wrong Answer

Solution code:
n = int(input())
items = []
for i in range(n):
  items.append(int(input()))
print(sum(items)-max(items)/2)

Submission status: Wrong Answer

Solution code:
items = input()
items = items.split()
items2 = []
for i in items:
  items2.append(int(i))
maxitem = max(items2)
print(sum(items2)-maxitem/2)

Submission status: Wrong Answer

Solution code:
n = int(input())
p =[int(input())for i in range(n)]

m = max(p)/2
print(m+sum(p)-max(p))

Submission status: Wrong Answer

Solution code:
N = int(input())

p = [int(input()) for _ in range(N)]
mp = max(p)
print(mp+ p[i] for i in range(len(p)))

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 permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N = INT()
p = [INT() for _ in range(N)]

print(sum(p)-1/2*max(p))

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(i) for i in input()]
p.sort(reverse=True)
ans=sum(p)-p[0]//2
print(ans)

Submission status: Wrong Answer

Solution code:
N,*p = map(int,open(0).read().split())
p.sort()
p[-1] /= 2
print(sum(p))

Submission status: Wrong Answer

Solution code:
N = int(input())
p = [int(input()) for i in range(N)]
print(sum(p) - max(p)/2)

Submission status: Wrong Answer

Solution code:
N = int(input())
p = [int(input()) for i in range(N)]
p.sort()
hangaku = p[N-1]/2
sum = 0
for i in range(N) :
    sum += p[i]
sum -= hangaku
print(sum)

Submission status: Wrong Answer

Solution code:
N,*P=map(int,open(0).read().split());print(sum(P)-max(P)/2)

Submission status: Wrong Answer

Solution code:
N = int(input())
P = []
for i in range(N):
    p = int(input())
    P.append(p)
    
price = sum(P) - max(P) / 2
print(price)

Submission status: Wrong Answer

Solution code:
s = int(input())
m = [int(input()) for i in range(s)]
l = sorted(m)
print(l[-1]/2 + sum(l) - l[-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
lst = []
for i in range(N):
    lst.append(int(input()))
lst.sort()
lst[-1] = lst[-1]/2
print(sum(lst))

Submission status: Wrong Answer

Solution code:
*a,=map(int, open(0))
print(sum(a)-max(a)//2-4)

Submission status: Wrong Answer

Solution code:
N = int(input())
p = [0] * N
for i in range(N):
  p[i]=int(input())
  
p = sorted(p,reverse=True)
ans = p.pop(0) / 2 +sum(p)
print(ans)

Submission status: Wrong Answer

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

print(sum(x)-max(x)//2)

Submission status: Wrong Answer

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

print(sum(x)-max(x)+max(x)//2)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [int(input(i)) for i in range(n)]
print(sum(l)-int(0.5*max(l)))

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [int(input(i)) for i in range(n)]
print(sum(l)-int(0.5*max(l)))

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [int(input(i)) for i in range(n)]
print(sum(l)-0.5*max(l))

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [int(i) for i in range(n)]
print(sum(l)-0.5*max(l))

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    p = [int(input()) for _ in range(N)]
    
    ans = 0
    max_p = max(p)

    for i in p:
        if i == max_p:
            ans += i // 2
        else:
            ans += i

    print(ans)

main()

Submission status: Wrong Answer

Solution code:
n = int(input())
l = []
for i in range(n):
    l.append(int(input()))
print(sum(l)-max(l)/2)

Submission status: Wrong Answer

Solution code:
N =int(input())
list = [int(input()) for i in range(N)]
print(sum(list)-list[-1]//2)

Submission status: Wrong Answer

Solution code:
lst = [int(input()) for _ in range(int(input()))]
print(sum(lst) - max(lst) / 2)

Submission status: Wrong Answer

Solution code:
n = int(input())

max_index = 0
max_price = 0
price_list = []

for i in range(0, n):
    p = int(input())
    price_list.append(p)
    if max_price < p:
        max_index = i

sum = 0
for i, p in enumerate(price_list):
    if i == max_index:
        sum += p / 2
    else:
        sum += p

print(sum)

Submission status: Wrong Answer

Solution code:
N = int(input())
P = [int(input()) for _ in range(N) ]
total = 0
for p in P:
    print(p)
    total += p
print(total - max(P)//2 )

Submission status: Wrong Answer

Solution code:
def resolve():
    P = list(int(input()) for _ in range(int(input())))
    print(sum(P)-max(P)//2)
print(resolve())

Submission status: Wrong Answer

Solution code:
n = int(input())
p = [int(input()) for i in range(n)]
print(sum(p) - max(p)/2)

Submission status: Wrong Answer

Solution code:
p = list(map(int, input().split()))
print(sum(p) - max(p)/2)

Submission status: Wrong Answer

Solution code:
l = [int(input()) for _ in range(int(input()))]
print(sum(l) - max(l)/2)

Submission status: Wrong Answer

Solution code:
N=int(input())
p=[int(input()) for i in range(N)]
p.sort(reverse=True)
p[0]=0.5*p[0]
s=sum(p)
print(s)

Submission status: Wrong Answer

Solution code:
n = int(input())
p = []

for i in range(n):
    p.append(int(input()))

maxV = max(p)
count = 0

for i in range(n):
    if p[i] == maxV:
        count += maxV // 2
    else:
        count += p[i]

print(count)

Submission status: Wrong Answer

Solution code:
price = [ int(input()) for _ in range( int(input()))]
print(sum(price) - int(min(price)/2))

Submission status: Wrong Answer

Solution code:
n=int(input())
price_list=[int(input()) for i in range(n)]
print(sum(price_list)-min(price_list)//2)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [int(input()) for _ in [0]*n]
print(l)
print(sum(l)-max(l)//2)

Submission status: Wrong Answer

Solution code:
n = int(input())
maximum = 0
li = list(map(int,input().split()))
print(sum(li)-max(li)/2)

Submission status: Wrong Answer

Solution code:
N = int(input())
listP = [int(input()) for i in range(N)]
print(sum(listP)-min(listP)//2)

Submission status: Wrong Answer

Solution code:

nN = int(input())
nP = [ 0 for i in range(nN)]

for i in range(nN):
  nP[i] = int(input())

nP.sort(reverse=True)

nAns = 0
for i in range(nN):
  if i == 0:
    nAns += (nP[i]/2)
  else:
    nAns += nP[i]

print(nAns)

Submission status: Wrong Answer

Solution code:
l=int(input())
b=[int(input()) for i in range(l)]
print(sum(b)-max(b)/2)

Submission status: Wrong Answer

Solution code:
l=int(input())
b=[int(i) for i in range(l)]
print(sum(b)-max(b)/2)

Submission status: Wrong Answer

Solution code:
n = int(input())
p = sorted([int(input()) for _ in range(n)])
sum = 0
for i in range(n-1):
  sum += p[i]
sum += p[-1]/2
print(sum)

Submission status: Wrong Answer

Solution code:
n = int(input())
p = list(sorted(map(int,input().split())))
res = sum(p[1:-1]) + p[-1]//2
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
li = [int(input()) for _ in range(n)]

print(sum(li) - min(li) // 2)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = [int(input()) for _ in range(a)]
b = sorted(b, reverse=True)
c = 1
for i in range(a):
    if i == 0:
        c += b[i] // 2
    else:
        c += b[i]
print(c)

Submission status: Wrong Answer

Solution code:
S=int(input())

p=[int(input()) for i in  range(S)]

p.sort(reverse=True)

money=0

for i in range(S):
    money+=p[i]

print(money-p[0]/2)

Submission status: Wrong Answer

Solution code:
from sys import stdin
N = int(input())
P = sorted([int(p) for p in stdin.read().splitlines()])

print(P[-1]/2+sum(P[:-1]))

Submission status: Wrong Answer

Solution code:
from sys import stdin
N = int(input())
P = sorted([int(p) for p in stdin.read().splitlines()])

print(P[-1]+sum(P[:-1]))

Submission status: Wrong Answer

Solution code:
s=int(input())

def func(n):
    if n%2==0:
        return n/2
    else:
        return 3*n+1

a=[]
a.append(s)
for i in range(1,1000000):
    p=func(a[i-1])
    if not p in a:
        a.append(p)
    else:
        print(i+1)
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
p = list(int(input()) for i in range(n))
a = p.pop(p.index(max(p))) / 2
print(sum(p) + a)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input()) for i in range(n)]

print(sum(p)-(max(p)/2))

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input()) for _ in range(n)]
print(sum(p)-max(p)/2)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input()) for i in range(n)]
print(sum(p)-max(p)/2)

Submission status: Wrong Answer

Solution code:
N = int(input())
p_List = list(int(input()) for i in range(N))
print(p_List)
Max = max(p_List)

Sum = sum(p_List) - Max / 2

print(int(Sum))

Submission status: Wrong Answer

Solution code:
n = int(input())
p_list=[]
for i in range(n):
    p_list.append(int(i))
print(sum(p_list) - max(p_list)//2)

Submission status: Wrong Answer

Solution code:

def main():
    # parse
    vars = parse()
    # compute
    result = compute(vars)
    # show result
    print(result)

def compute(vars):
    return sum(vars)

def parse():
    N = int(get_stdin())
    vars = []
    for _ in range(N):
      vars.append(int(get_stdin()))
    return vars

def get_stdin():
    return input()

def split_stdin(stdin_val, delim = ' '):
    return [x for x in stdin_val.split(delim) if x != '']

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
sum = 0
high = 0
for i in range(n):
	x = int(input())
	sum += x
	if high<x:
		high = x
sum -= x//2
print(sum)

Submission status: Wrong Answer

Solution code:
n = int(input())
p = []
for i in range(n):
    p.append(int(input()))

p_max = max(p)

print(sum(p) - p_max / 2)

Submission status: Wrong Answer

Solution code:
N = int(input())
p = [0 for i in range(N)]
for i in range(N):
    p[i] = int(input())
p.sort()
print(sum(p)-(p[0]//2))

Submission status: Wrong Answer

Solution code:
n = int(input())
p = [int(input()) for i in range(n)]
p_max = p[0]
for j in range(1, n):
    if p[j] >= p_max:
        p_max = p[j]
for k in range(n):
    if p[k] == p_max:
        p[k] = int(p[k] / 2)
print(sum(p))

Submission status: Wrong Answer

Solution code:

n = int(input())
present_list = [0]*n
for i in range(n):
	present_list[i] = int(input())

print(sum(present_list)-present_list[-1]//2)

Submission status: Wrong Answer

Solution code:
n = int(input())
p = list(range(n))

for i in range(n):
	p[i] = int(input())
	p[p.index(max(p))] //= 2
	ans = sum(p)
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
max_item = 0
sum_item = 0
for _ in range(N):
  c = int(input())
  sum_item += c
  max_item = max(c, max_item)

sum_item -= max_item / 2

print(sum_item)

Submission status: Wrong Answer

Solution code:
D = int(input())
print("Christmas",end = "")
while (D != 25):
    print(" Eve",end = "")
    D += 1
print()

Submission status: Wrong Answer

Solution code:
N, *d = map(int, open(0).read().split())
print(sum(d)-max(d)/2)

Submission status: Wrong Answer

Solution code:
n = int(input())

plist = list(int(input()) for i in range(n))
max_price = plist[0]
count = 0

for j in range(0,n-1):
    if  plist[j] < plist[j+1]:
        max_price = plist[j+1]
        count = j +1

discount = plist.pop(count)
total = int(discount/2 + sum(plist))

print(total)

Submission status: Wrong Answer

Solution code:
n = int(input())

plist = list(int(input()) for i in range(n))
max_price = plist[0]
count = 0

for j in range(0,n-1):
    if  plist[j] < plist[j+1]:
        max_price = plist[j+1]
        count = j +1

discount = plist.pop(count)
sum = int(discount/2 + sum(plist))

print(sum)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=[int(input())for i in range(n)]
maxp=p.pop(p.index(max(p)))
ans=0
for i in p:
  ans=ans+i
ans=ans+maxp
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
P = [int(input()) for _ in range(n)]

P.sort()
print(int(P[n-1]/2) + sum(P[1:]))

Submission status: Wrong Answer

Solution code:
n = int(input())
P = [int(input()) for _ in range(n)]

P.sort()
print(int(P[0]/2) + sum(P[1:]))

Submission status: Wrong Answer

Solution code:
# coding: utf-8

n = int(input())

p = [int(input()) for i in range(n)]
x = sum(p) - max(p)

print(x)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

n = int(input())

p = [int(input(i)) for i in range(n)]
x = sum(p) - max(p)

print(x)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

n = int(input())

p = [int(input()) for _ in range(n)]
x = sum(p) - max(p)

print(x)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

n = int(input())

p = sorted([int(input()) for _ in range(n)])
x = sum(p) - p[n-1]

print(x)

Submission status: Wrong Answer

Solution code:
a=int(input())
b=[int(input()) for i in range(a)]
print(sum(b)-max(b)/2)

Submission status: Wrong Answer

Solution code:
n=int(input())

list=[]

for i in range(n):
  list.append(int(input()))
  
print(sum(list)-max(list)/2)

Submission status: Wrong Answer

Solution code:
N = int(input())

p = []
for n in range(N):
    p.append(n)

p_max = max(p)
p_sum = sum(p) - p_max
p_max *= 0.5

print(p_sum + p_max)

Submission status: Wrong Answer

Solution code:
import numpy as np
n = int(input())
arr = [int(input()) for _ in range(n)]
arg_m = np.argmax(arr)
total = (arr[arg_m]//2) + sum(arr[arg_m+1:])
print(total)

Submission status: Wrong Answer

Solution code:
N = int(input())
p = []
for i in range(N):
    x = int(input())
    p.append(x)

ans = 0
for i in range(N):
    if p[i] == max(p):
       ans += int(p[i]/2)
    else:
        ans += p[i]

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
A=[int(input()) for i in range(n)]
cnt=0

for i in range(n):
  cnt+=A[i]
cnt-=max(A)*0.5
print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())
P = [None] * N
for i in range(N):
  P[i] = int(input())
ans = sum(P) - max(P)/2
print(ans)

Submission status: Wrong Answer

Solution code:
a=sorted( [int(input()) for _ in range(int(input()))] )
a[0] //= 2
print(sum(a))

Submission status: Wrong Answer

Solution code:
l=[]
for i in range(int(input())):l+=[int(input())]
l.sort()
print(int(l[0]//2+sum(l[1:])))

Submission status: Wrong Answer

Solution code:
l=[]
for i in range(int(input())):l+=[int(input())]
l.sort()
print(int(l[0]/2+sum(l[1:])))

Submission status: Wrong Answer

Solution code:
a = int(input())
b = []
for i in range(a):
  b.append(int(input()))
 
b.sort()
 
b[-1] = b[-1] / 2
 
print(sum(b))

Submission status: Wrong Answer

Solution code:
n = int(input())
array = []
for i in range(n):
    a = int(input())
    array.append(a)

array.sort()
array[-1] = max(array) // 2
total = sum(array)
print(array)
print(total)

Submission status: Wrong Answer

Solution code:
N = int(input())
P = [int(input()) for i in range(N)]

M = max(P)

print(sum(P) - M + M/2)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = [int(input()) for i in range(N)]
MAX_PRICE = max(a)

SUM = sum(a) - MAX_PRICE/2

print(SUM)

Submission status: Wrong Answer

Solution code:
n = int(input())
list = []
for i in range(n):
  list.append(int(input()))

p_max = max(list)

ans = sum(list) - p_max/2

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(input()) for i in range(n)]
b=sum(a)-max(a)/2
print(b)

Submission status: Wrong Answer

Solution code:
N = int(input())
c=list(map(int, input().split()))
k = 0
for i in range(len(c)):
  k = max(c[i],k)
total = 0
for j in range(len(c)):
  total = total + c[j]
k = k/2
m = int(k)
total= total- m
print(total)

Submission status: Wrong Answer

Solution code:
N = int(input())
c=list(map(int, input().split()))
k = 0
for i in range(len(c)):
  k = max(c[i],k)
total = 0
for j in range(len(c)):
  total = total + c[j]
k = k/2
m = int(k)
total=total-m
print(total)

Submission status: Wrong Answer

Solution code:
N = int(input())
p = [int(input()) for i in range(N)]
p = sorted(p)
print(int(p[0]/2+sum(p)-p[0]))

Submission status: Wrong Answer

Solution code:
N = int(input())
p = [0]*N
for i in range(N):
    p[i] = int(input())
p.sort()
print(-p[-1] / 2 + sum(p))

Submission status: Wrong Answer

Solution code:
N = int(input())
a = list()
for i in range(N):
  a.append(int(input()))
a.sort()
print(sum(a)-(a[N-1]/2))