Delivery Man

All submissions for this problem are available.
Read problems statements in Mandarin Chinese and Russian.
Andy and Bob are the only two delivery men of Pizzachef store. Today, the store received N orders.
It's known that the amount of tips may be different when handled by different delivery man.
More specifically, if Andy takes the i^{th} order, he would be tipped A_{i} dollars and if Bob takes this order,
the tip would be B_{i} dollars.
They decided that they would distribute the orders among themselves to maximize the total tip money. One order will be handled by only
one person. Also, due to time constraints Andy cannot take more than X orders and Bob cannot take more than
Y orders. It is guaranteed that X + Y is greater than or equal to N, which means that all the orders can be handled
by either Andy or Bob.
Please find out the maximum possible amount of total tip money after processing all the orders.
Input
 The first line contains three integers N, X, Y.
 The second line contains N integers. The i^{th} integer represents A_{i}.
 The third line contains N integers. The i^{th} integer represents B_{i}.
Output
 Print a single integer representing the maximum tip money they would receive.
Constraints
All test:
 1 ≤ N ≤ 10^{5}
 1 ≤ X, Y ≤ N; X + Y ≥ N
 1 ≤ A_{i}, B_{i} ≤ 10^{4}
10 points:
 1 ≤ N ≤ 20
30 points:
 1 ≤ N ≤ 5000
60 points:
 1 ≤ N ≤ 10^{5}
Example
Input: 5 3 3 1 2 3 4 5 5 4 3 2 1 Output: 21
Explanation
Bob will take the first three orders (or the first two) and Andy will take the rest (of course).
Author:  tuananh93 
Tester:  stzgd 
Editorial  http://discuss.codechef.com/problems/TADELIVE 
Tags  dp greedy ltime19 simple tuananh93 
Date Added:  6122014 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.3.2, CPP 4.9.2, CPP14, CS2, D, ERL, FORT, FS, GO, HASK, ICK, ICON, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, NODEJS, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.4, RUBY, SCALA, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 
#include using namespace
good q for me