A. The Rank

Codeforces

IDCF1017A

Time1000ms

Memory256MB

Difficulty—

implementation

English · Original

Chinese · Translation

Formal · Original

John Smith knows that his son, Thomas Smith, is among the best students in his class and even in his school. After the students of the school took the exams in English, German, Math, and History, a table of results was formed. There are $n$ students, each of them has a **unique** id (from $1$ to $n$). Thomas's id is $1$. Every student has four scores correspond to his or her English, German, Math, and History scores. The students are given in order of increasing of their ids. In the table, the students will be sorted by **decreasing** the sum of their scores. So, a student with the largest sum will get the first place. If two or more students have the same sum, these students will be sorted by **increasing** their ids. Please help John find out the rank of his son. ## Input The first line contains a single integer $n$ ($1 \le n \le 1000$) — the number of students. Each of the next $n$ lines contains four integers $a_i$, $b_i$, $c_i$, and $d_i$ ($0\leq a_i, b_i, c_i, d_i\leq 100$) — the grades of the $i$\-th student on English, German, Math, and History. The id of the $i$\-th student is equal to $i$. ## Output Print the rank of Thomas Smith. Thomas's id is $1$. [samples] ## Note In the first sample, the students got total scores: $398$, $400$, $398$, $379$, and $357$. Among the $5$ students, Thomas and the third student have the second highest score, but Thomas has a smaller id, so his rank is $2$. In the second sample, the students got total scores: $369$, $240$, $310$, $300$, $300$, and $0$. Among the $6$ students, Thomas got the highest score, so his rank is $1$.

John Smith 知道他的儿子 Thomas Smith 是班级乃至学校中最优秀的学生之一。在学生们参加了英语、德语、数学和历史考试后，形成了一个成绩表。共有 $n$ 名学生，每人有一个*唯一*的编号（从 $1$ 到 $n$）。Thomas 的编号是 $1$。每个学生有四个成绩，分别对应其英语、德语、数学和历史成绩。学生按编号递增的顺序给出。在表中，学生将按总分*降序*排列，总分最高的学生排在第一位。如果两个或更多学生总分相同，则按编号*升序*排列。请帮助 John 找出他儿子的排名。第一行包含一个整数 $n$（$1 lt.eq n lt.eq 1000$）——学生的数量。接下来的 $n$ 行，每行包含四个整数 $a_i$、$b_i$、$c_i$ 和 $d_i$（$0 lt.eq a_i, b_i, c_i, d_i lt.eq 100$）——第 $i$ 名学生的英语、德语、数学和历史成绩。第 $i$ 名学生的编号等于 $i$。请输出 Thomas Smith 的排名。Thomas 的编号是 $1$。在第一个样例中，学生的总分为：$398$、$400$、$398$、$379$ 和 $357$。在 $5$ 名学生中，Thomas 和第三名学生并列第二高分，但 Thomas 的编号更小，因此他的排名是 $2$。在第二个样例中，学生的总分为：$369$、$240$、$310$、$300$、$300$ 和 $0$。在 $6$ 名学生中，Thomas 的分数最高，因此他的排名是 $1$。 ## Input 第一行包含一个整数 $n$（$1 lt.eq n lt.eq 1000$）——学生的数量。接下来的 $n$ 行，每行包含四个整数 $a_i$、$b_i$、$c_i$ 和 $d_i$（$0 lt.eq a_i, b_i, c_i, d_i lt.eq 100$）——第 $i$ 名学生的英语、德语、数学和历史成绩。第 $i$ 名学生的编号等于 $i$。 ## Output 请输出 Thomas Smith 的排名。Thomas 的编号是 $1$。 [samples] ## Note 在第一个样例中，学生的总分为：$398$、$400$、$398$、$379$ 和 $357$。在 $5$ 名学生中，Thomas 和第三名学生并列第二高分，但 Thomas 的编号更小，因此他的排名是 $2$。在第二个样例中，学生的总分为：$369$、$240$、$310$、$300$、$300$ 和 $0$。在 $6$ 名学生中，Thomas 的分数最高，因此他的排名是 $1$。

**Definitions** Let $ n \in \mathbb{Z} $ be the number of students. Let $ S_i = a_i + b_i + c_i + d_i $ be the total score of student $ i $, for $ i \in \{1, 2, \dots, n\} $. Thomas Smith has id $ 1 $. **Constraints** 1. $ 1 \leq n \leq 1000 $ 2. For all $ i \in \{1, \dots, n\} $, $ 0 \leq a_i, b_i, c_i, d_i \leq 100 $ **Objective** Sort the students by: - Primary: decreasing total score $ S_i $ - Secondary: increasing student id $ i $ (for ties in $ S_i $) Let $ R $ be the rank (1-indexed position) of student $ 1 $ (Thomas Smith) in this sorted order. Output $ R $.

Samples

Input #1

5
100 98 100 100
100 100 100 100
100 100 99 99
90 99 90 100
100 98 60 99

Output #1

Input #2

6
100 80 90 99
60 60 60 60
90 60 100 60
60 100 60 80
100 100 0 100
0 0 0 0

Output #2

API Response (JSON)

{
  "problem": {
    "name": "A. The Rank",
    "description": {
      "content": "John Smith knows that his son, Thomas Smith, is among the best students in his class and even in his school. After the students of the school took the exams in English, German, Math, and History, a ta",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF1017A"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "John Smith knows that his son, Thomas Smith, is among the best students in his class and even in his school. After the students of the school took the exams in English, German, Math, and History, a ta...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "John Smith 知道他的儿子 Thomas Smith 是班级乃至学校中最优秀的学生之一。在学生们参加了英语、德语、数学和历史考试后，形成了一个成绩表。\n\n共有 $n$ 名学生，每人有一个*唯一*的编号（从 $1$ 到 $n$）。Thomas 的编号是 $1$。每个学生有四个成绩，分别对应其英语、德语、数学和历史成绩。学生按编号递增的顺序给出。\n\n在表中，学生将按总分*降序*排列，总分最高的...",
      "is_translate": true,
      "language": "Chinese"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ n \\in \\mathbb{Z} $ be the number of students.  \nLet $ S_i = a_i + b_i + c_i + d_i $ be the total score of student $ i $, for $ i \\in \\{1, 2, \\dots, n\\} $.  \nThomas Smith has id...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments