4224: April Fools' Problem (medium)
内存限制：256 MB
时间限制：2 S
标准输入输出
题目类型：传统
评测方式：文本比较
上传者：
提交：1
通过：1
题目描述
time limit per test
4 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputThe marmots need to prepare k problems for HC2 over n days. Each problem, once prepared, also has to be printed.
The preparation of a problem on day i (at most one per day) costs ai CHF, and the printing of a problem on day i (also at most one per day) costs bi CHF. Of course, a problem cannot be printed before it has been prepared (but doing both on the same day is fine).
What is the minimum cost of preparation and printing?
The preparation of a problem on day i (at most one per day) costs ai CHF, and the printing of a problem on day i (also at most one per day) costs bi CHF. Of course, a problem cannot be printed before it has been prepared (but doing both on the same day is fine).
What is the minimum cost of preparation and printing?
Input
The first line of input contains two space-separated integers n and k (1≤k≤n≤2200). The second line contains n space-separated integers a1,...,an (
) − the preparation costs. The third line contains n space-separated integers b1,...,bn (
) − the printing costs.Output
Output the minimum cost of preparation and printing k problems − that is, the minimum possible sum ai1+ai2+...+aik+bj1+bj2+...+bjk, where 1≤i1<i2<...<ik≤n, 1≤j1<j2<...<jk≤n and i1≤j1, i2≤j2, ..., ik≤jk.Example
Input
8 4
3 8 7 9 9 4 6 8
2 5 9 4 3 8 9 1
Output
32
Note
In the sample testcase, one optimum solution is to prepare the first problem on day 1 and print it on day 1, prepare the second problem on day 2 and print it on day 4, prepare the third problem on day 3 and print it on day 5, and prepare the fourth problem on day 6 and print it on day 8.输入样例 复制
输出样例 复制