Problem Set

AtCoder

IDcode_festival_2017_qualb_b

Time2000ms

Memory256MB

Difficulty—

Rng is preparing a problem set for a qualification round of CODEFESTIVAL. He has $N$ candidates of problems. The difficulty of the $i$\-th candidate is $D_i$. There must be $M$ problems in the problem set, and the difficulty of the $i$\-th problem must be $T_i$. Here, one candidate of a problem cannot be used as multiple problems. Determine whether Rng can complete the problem set without creating new candidates of problems. ## Constraints * $1 \leq N \leq 200,000$ * $1 \leq D_i \leq 10^9$ * $1 \leq M \leq 200,000$ * $1 \leq T_i \leq 10^9$ * All numbers in the input are integers. ## Input Input is given from Standard Input in the following format: $N$ $D_1$ $D_2$ $...$ $D_N$ $M$ $T_1$ $T_2$ $...$ $T_M$ ## Partial Score * $100$ points will be awarded for passing the test set satisfying $N \leq 100$ and $M \leq 100$. [samples]

Samples

Input #1

Output #1

YES

Input #2

7
100 200 500 700 1200 1600 2000
6
100 200 500 700 1600 1600

Output #2

NO

Not enough $1600$s.

Input #3

1
800
5
100 100 100 100 100

Output #3

NO

Input #4

15
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
9
5 4 3 2 1 2 3 4 5

Output #4

YES

API Response (JSON)

{
  "problem": {
    "name": "Problem Set",
    "description": {
      "content": "Rng is preparing a problem set for a qualification round of CODEFESTIVAL. He has $N$ candidates of problems. The difficulty of the $i$\\-th candidate is $D_i$. There must be $M$ problems in the problem",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "code_festival_2017_qualb_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Rng is preparing a problem set for a qualification round of CODEFESTIVAL.\nHe has $N$ candidates of problems. The difficulty of the $i$\\-th candidate is $D_i$.\nThere must be $M$ problems in the problem...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments