Polygon

AtCoder

IDabc117_b

Time2000ms

Memory256MB

Difficulty—

Determine if an $N$\-sided polygon (not necessarily convex) with sides of length $L_1, L_2, ..., L_N$ can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem**: an $N$\-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other $N-1$ sides. ## Constraints * All values in input are integers. * $3 \leq N \leq 10$ * $1 \leq L_i \leq 100$ ## Input Input is given from Standard Input in the following format: $N$ $L_1$ $L_2$ $...$ $L_N$ [samples]

Samples

Input #1

4
3 8 5 1

Output #1

Yes

Since $8 < 9 = 3 + 5 + 1$, it follows from the theorem that such a polygon can be drawn on a plane.

Input #2

4
3 8 4 1

Output #2

No

Since $8 \geq 8 = 3 + 4 + 1$, it follows from the theorem that such a polygon cannot be drawn on a plane.

Input #3

10
1 8 10 5 8 12 34 100 11 3

Output #3

No

API Response (JSON)

{
  "problem": {
    "name": "Polygon",
    "description": {
      "content": "Determine if an $N$\\-sided polygon (not necessarily convex) with sides of length $L_1, L_2, ..., L_N$ can be drawn in a two-dimensional plane. You can use the following theorem: **Theorem**: an $N$\\-s",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc117_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Determine if an $N$\\-sided polygon (not necessarily convex) with sides of length $L_1, L_2, ..., L_N$ can be drawn in a two-dimensional plane.\nYou can use the following theorem:\n**Theorem**: an $N$\\-s...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments