5579: Nuts坚果（ABC204B)
内存限制：1024 MB
时间限制：2.000 S
评测方式：文本比较
命题人：
提交：2
解决：2
题目描述
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.
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.
花栗有N棵树。第i棵树上有Ai 个坚果。
花栗鼠将按以下方式从树上收获坚果:
-
对于有10个或更少坚果的树，它不会收获任何坚果。
-
对于有超过10个坚果的树，它会收获除了10个以外的所有坚果。
请计算花栗鼠总共会从这些树上收获多少个坚果。
输入
N
A1 A2……AN
输出
Print the answer.
样例输入 复制
3
6 17 28样例输出 复制
25提示
Constraints：
- $1 \leq N \leq 1000$
- $0 \leq A_i \leq 1000$
- All values in input are integers.
- $1 \leq N \leq 1000$
- $0 \leq A_i \leq 1000$
- All values in input are integers.