{"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. Here, all of the following conditions must be satisfied.\n\n*   For every kind of snack, Child $i$ gets at most $B_i$ pieces of that kind.\n    \n*   Child $i$ gets at most $C_i$ pieces of snacks in total.\n    \n\nFind the maximum total number of pieces of snacks that can be distributed to the children under these conditions.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq M \\leq 2 \\times 10^5$\n*   $1 \\leq A_i \\leq 10^{12}$\n*   $1 \\leq B_i \\leq 10^7$\n*   $1 \\leq C_i \\leq 10^{12}$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $A_2$ $\\cdots$ $A_N$\n$B_1$ $B_2$ $\\cdots$ $B_M$\n$C_1$ $C_2$ $\\cdots$ $C_M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc125_e","tags":[],"sample_group":[["3 3\n2 5 5\n1 2 2\n5 3 5","11\n\nThe optimal distribution of snacks is as follows.\n\n*   Child $1$ gets $1$, $1$, $1$ piece of Snacks $1$, $2$, $3$, respectively.\n    \n*   Child $2$ gets $0$, $2$, $1$ piece(s) of Snacks $1$, $2$, $3$, respectively.\n    \n*   Child $3$ gets $1$, $2$, $2$ piece(s) of Snacks $1$, $2$, $3$, respectively."],["10 6\n3 54 62 64 25 89 1 47 77 4\n1 17 10 29 95 17\n32 40 90 27 50 9","211"]],"created_at":"2026-03-03 11:01:14"}}