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.

Solution in Rust (1.15.1) (judge verdict: Accepted)

// B - Christmas Eve Eve
// https://atcoder.jp/contests/abc115/tasks/abc115_b

use std::io::*;
use std::str::*;

fn main() {
    let n: u64 = read_number();
    let mut v: Vec<u64> = Vec::new();
    for _i in 0..n {
        v.push(read_number());
    }

    let ans = solve(v);
    println!("{}", ans);
}

fn read_number() -> u64 {
    let mut in_str = String::new();
    stdin().read_line(&mut in_str).ok();
    let num = u64::from_str(&in_str.trim_right()).expect("error parsing input");

    num
}

fn solve(ps: Vec<u64>) -> u64 {
    let mut sum = 0;
    let mut biggest = 0;
    for p in ps {
        if p > biggest {
            biggest = p;
        }
        sum += p;
    }
    sum -= biggest / 2;

    sum
}

#[test]
fn test_solve() {
    let v1 = vec![4980, 7980, 6980];
    assert_eq!(solve(v1), 15950);

    let v2 = vec![4320, 4320, 4320, 4320];
    assert_eq!(solve(v2), 15120);
}