| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 4 초 | 512 MB | 617 | 434 | 393 | 70.811% |
Gahui is watching the annual character election. After the election, The top 16 characters receive enormous benefits for one year. For that reason, fans vote passionately to get their favorite characters into the top 16. Remarkably, at least one Cinderella appears in every election, achieving an outstanding outcome.
Of course, the ranking is high if the number of votes is high. Gahui supports only one character. Find the ranking of the character she supports.
The first line gives $n$, the number of characters participating in the election.
The second line gives the number of votes for the character Gahui supports.
In the third line, $n-1$ integers are given, separated by spaces. These integers represent the number of votes for characters that Gahui does not support.
Print the ranking of the character Gahui supports.
10 97026 117421 84792 41751 98302 135059 32043 128569 76353 8647
5
Contest > BOJ User Contest > 가희와 함께 하는 코딩 테스트 > 가희와 함께 하는 6회 코딩 테스트 B번