Popular Vote

AtCoder

IDabc161_b

Time2000ms

Memory256MB

Difficulty—

We have held a popularity poll for $N$ items on sale. Item $i$ received $A_i$ votes. From these $N$ items, we will select $M$ as popular items. However, we cannot select an item with less than $\dfrac{1}{4M}$ of the total number of votes. If $M$ popular items can be selected, print `Yes`; otherwise, print `No`. ## Constraints * $1 \leq M \leq N \leq 100$ * $1 \leq A_i \leq 1000$ * $A_i$ are distinct. * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $M$ $A_1$ $...$ $A_N$ [samples]

Samples

Input #1

4 1
5 4 2 1

Output #1

Yes

There were $12$ votes in total. The most popular item received $5$ votes, and we can select it.

Input #2

3 2
380 19 1

Output #2

No

There were $400$ votes in total. The second and third most popular items received less than $\dfrac{1}{4\times 2}$ of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.

Input #3

12 3
4 56 78 901 2 345 67 890 123 45 6 789

Output #3

Yes

API Response (JSON)

{
  "problem": {
    "name": "Popular Vote",
    "description": {
      "content": "We have held a popularity poll for $N$ items on sale. Item $i$ received $A_i$ votes. From these $N$ items, we will select $M$ as popular items. However, we cannot select an item with less than $\\dfrac",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc161_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have held a popularity poll for $N$ items on sale. Item $i$ received $A_i$ votes.\nFrom these $N$ items, we will select $M$ as popular items. However, we cannot select an item with less than $\\dfrac...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments