{"problem":{"name":"City Savers","description":{"content":"There are $N+1$ towns. The $i$\\-th town is being attacked by $A_i$ monsters. We have $N$ heroes. The $i$\\-th hero can defeat monsters attacking the $i$\\-th or $(i+1)$\\-th town, for a total of at most ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc135_c"},"statements":[{"statement_type":"Markdown","content":"There are $N+1$ towns. The $i$\\-th town is being attacked by $A_i$ monsters.\nWe have $N$ heroes. The $i$\\-th hero can defeat monsters attacking the $i$\\-th or $(i+1)$\\-th town, for a total of at most $B_i$ monsters.\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq A_i \\leq 10^9$\n*   $1 \\leq B_i \\leq 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_{N+1}$\n$B_1$ $B_2$ $...$ $B_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc135_c","tags":[],"sample_group":[["2\n3 5 2\n4 5","9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\n*   The first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n*   The second hero defeats three monsters attacking the second town and two monsters attacking the third town."],["3\n5 6 3 8\n5 100 8","22"],["2\n100 1 1\n1 100","3"]],"created_at":"2026-03-03 11:01:14"}}