Snack

AtCoder

IDarc125_e

Time2000ms

Memory256MB

Difficulty—

There are $N$ kinds of snacks numbered $1$ through $N$. We have $A_i$ pieces of Snack $i$. There are $M$ children numbered $1$ through $M$. We will distribute the pieces of snacks to these children. Here, all of the following conditions must be satisfied. * For every kind of snack, Child $i$ gets at most $B_i$ pieces of that kind. * Child $i$ gets at most $C_i$ pieces of snacks in total. Find the maximum total number of pieces of snacks that can be distributed to the children under these conditions. ## Constraints * $1 \leq N \leq 2 \times 10^5$ * $1 \leq M \leq 2 \times 10^5$ * $1 \leq A_i \leq 10^{12}$ * $1 \leq B_i \leq 10^7$ * $1 \leq C_i \leq 10^{12}$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $M$ $A_1$ $A_2$ $\cdots$ $A_N$ $B_1$ $B_2$ $\cdots$ $B_M$ $C_1$ $C_2$ $\cdots$ $C_M$ [samples]

Samples

Input #1

Output #1

11

The optimal distribution of snacks is as follows.

*   Child $1$ gets $1$, $1$, $1$ piece of Snacks $1$, $2$, $3$, respectively.
    
*   Child $2$ gets $0$, $2$, $1$ piece(s) of Snacks $1$, $2$, $3$, respectively.
    
*   Child $3$ gets $1$, $2$, $2$ piece(s) of Snacks $1$, $2$, $3$, respectively.

Input #2

10 6
3 54 62 64 25 89 1 47 77 4
1 17 10 29 95 17
32 40 90 27 50 9

Output #2

API Response (JSON)

{
  "problem": {
    "name": "Snack",
    "description": {
      "content": "There are $N$ kinds of snacks numbered $1$ through $N$. We have $A_i$ pieces of Snack $i$. There are $M$ children numbered $1$ through $M$. We will distribute the pieces of snacks to these children. H",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc125_e"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There are $N$ kinds of snacks numbered $1$ through $N$. We have $A_i$ pieces of Snack $i$.\nThere are $M$ children numbered $1$ through $M$. We will distribute the pieces of snacks to these children. H...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments