Score : $200$ points

问题描述

有 $N$ 棵树。第 $i$ 棵树结了 $A_i$ 颗坚果。

花栗鼠将以以下方式采集坚果：

• 对于结有 $10$ 颗或更少坚果的树，她不取走坚果。
• 对于结有多于 $10$ 颗坚果的树，她会取走除了 $10$ 颗以外的所有坚果。

请计算花栗鼠将从这些树上总共取走多少颗坚果。

以上为通义千问 qwen-max 翻译，仅供参考。

Problem Statement

There are $N$ trees. The $i$-th tree bears $A_i$ nuts.

Chipmunk will harvest nuts from the trees in the following manner:

• From a tree with $10$ or fewer nuts, she does not take nuts.
• From a tree with more than $10$ nuts, she takes all but $10$ nuts.

Find the total number of nuts Chipmunk will take from the trees.

Constraints

• $1 \leq N \leq 1000$
• $0 \leq A_i \leq 1000$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

$N$

$A_1$ $\ldots$ $A_N$

Output

Print the answer.

Sample Input 1

3
6 17 28

Sample Output 1

25

From the three trees, Chipmunk will take $0$, $7$, and $18$ nuts, for a total of $25$ nuts.

Sample Input 2

4
8 9 10 11

Sample Output 2

1

update @ 2024/3/10 09:17:00