Different Distribution

AtCoder

IDtenka1_2017_b

Time2000ms

Memory256MB

Difficulty—

A group of people played a game. All players had distinct scores, which are non-negative integers. Takahashi knows $N$ facts on the players' scores. The $i$\-th fact is as follows: the $A_i$\-th highest score among the players is $B_i$. Find the maximum possible number of players in the game. ## Constraints * $1 \leq N \leq 10^5$ * $1 \leq A_i \leq 10^9(1\leq i\leq N)$ * $0 \leq B_i \leq 10^9(1\leq i\leq N)$ * If $i ≠ j$, $A_i ≠ A_j$. * There exists a possible outcome of the game that are consistent with the facts. * All input values are integers. ## Inputs Input is given from Standard Input in the following format: $N$ $A_1$ $B_1$ : $A_N$ $B_N$ [samples]

Samples

Input #1

Output #1

8

The maximum possible number of players is achieved when, for example, the players have the following scores: $12,9,8,7,5,2,1,0$.

Input #2

Output #2

Input #3

2
1 1000000000
1000000000 1

Output #3

1000000001

API Response (JSON)

{
  "problem": {
    "name": "Different Distribution",
    "description": {
      "content": "A group of people played a game. All players had distinct scores, which are non-negative integers. Takahashi knows $N$ facts on the players' scores. The $i$\\-th fact is as follows: the $A_i$\\-th highe",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "tenka1_2017_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "A group of people played a game. All players had distinct scores, which are non-negative integers.\nTakahashi knows $N$ facts on the players' scores. The $i$\\-th fact is as follows: the $A_i$\\-th highe...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments