6 1 0 2 80 60 80 60 70 70 40 20 50 90 90 80
1
4
5
* First, $1$ examinee with the highest math score is admitted.
* Examinee $1$ is tied with Examinee $3$, scoring the highest $80$ points in math, and the tie is broken by the examinees' numbers, so Examinee $1$ is admitted.
* Then, among the examinees who are not admitted yet, $0$ examinees with the highest English scores are admitted.
* Obviously, it does not affect the admissions.
* Then, among the examinees who are not admitted yet, $2$ examinees with the highest total scores in math and English are admitted.
* First, among the examinees who are not admitted yet, Examinee $5$ is admitted, scoring the highest total score of $160$ points.
* Next, among the examinees who are not admitted yet, Examinee $4$ is tied with Examinee $6$, scoring a total score of $150$ points. The tie is broken by the examinees' numbers, and Examinee $4$ is admitted.
Therefore, the examinees' numbers of the admitted examinees are $1$, $4$, and $5$. Print them in ascending order.5 2 1 2 0 100 0 100 0 0 0 100 100 0
1 2 3 4 5 All examinees may be admitted.
15 4 3 2 30 65 20 95 100 45 70 85 20 35 95 50 40 15 85 0 25 45 35 65 70 80 90 40 55 20 20 45 75 100
2 4 5 6 7 8 11 14 15
{
"problem": {
"name": "Better Students Are Needed!",
"description": {
"content": "$N$ examinees took an entrance exam. The examinee numbered $i$ scored $A_i$ points in math and $B_i$ points in English. The admissions are determined as follows. 1. $X$ examinees with the highest ",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc260_b"
},
"statements": [
{
"statement_type": "Markdown",
"content": "$N$ examinees took an entrance exam. \nThe examinee numbered $i$ scored $A_i$ points in math and $B_i$ points in English.\nThe admissions are determined as follows.\n\n1. $X$ examinees with the highest ...",
"is_translate": false,
"language": "English"
}
]
}