Cooking

AtCoder

IDabc204_d

Time2000ms

Memory256MB

Difficulty—

Takahashi is going to cook $N$ dishes called Dish $1$ through $N$. Dish $i$ can be cooked by using an oven for $T_i$ consecutive minutes. An oven cannot be used for two or more dishes simultaneously. If Takahashi has two ovens to use, what is the shortest number of minutes needed to cook all the $N$ dishes? Assume that all processes other than using ovens take negligible time. ## Constraints * $1 \leq N \leq 100$ * $1 \leq T_i \leq 10^3$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $T_1$ $\ldots$ $T_N$ [samples]

Samples

Input #1

5
8 3 7 2 5

Output #1

13

We can, for example, use the two ovens as follows to cook all the dishes in $13$ minutes.

*   The first oven: Cook Dishes $5$ and $1$ in this order.
*   The second oven: Cook Dishes $2$, $4$, and $3$ in this order.

Input #2

2
1000 1

Output #2

Input #3

9
3 14 15 9 26 5 35 89 79

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Cooking",
    "description": {
      "content": "Takahashi is going to cook $N$ dishes called Dish $1$ through $N$. Dish $i$ can be cooked by using an oven for $T_i$ consecutive minutes. An oven cannot be used for two or more dishes simultaneously. ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc204_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Takahashi is going to cook $N$ dishes called Dish $1$ through $N$.\nDish $i$ can be cooked by using an oven for $T_i$ consecutive minutes. An oven cannot be used for two or more dishes simultaneously.\n...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments