CF859A.Declined Finalists
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, though. Initially the top 25 contestants are invited to come onsite. Each eligible contestant must either accept or decline the invitation. Whenever a contestant declines, the highest ranked contestant not yet invited is invited to take the place of the one that declined. This continues until 25 contestants have accepted invitations.
After the qualifying round completes, you know K of the onsite finalists, as well as their qualifying ranks (which start at 1 , there are no ties). Determine the minimum possible number of contestants that declined the invitation to compete onsite in the final round.
输入格式
The first line of input contains K ( 1<=K<=25 ), the number of onsite finalists you know. The second line of input contains r1,r2,...,rK ( 1<=ri<=106 ), the qualifying ranks of the finalists you know. All these ranks are distinct.
输出格式
Print the minimum possible number of contestants that declined the invitation to compete onsite.
输入输出样例
输入#1
25 2 3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 28
输出#1
3
输入#2
5 16 23 8 15 4
输出#2
0
输入#3
3 14 15 92
输出#3
67
说明/提示
In the first example, you know all 25 onsite finalists. The contestants who ranked 1 -st, 13 -th, and 27 -th must have declined, so the answer is 3 .