Bulb replacement

Byteasar's new house needs only the finishing work. All that is left is to screw one bulb into each of the $n$ rooms. Every room has a minimum power that lights it well enough, so room $i$ needs a bulb of power at least $w_i$.

Byteasar has already bought $n$ bulbs, and now he sees that they do not fit his plan. Some rooms may stay too dark, and some bulbs draw more power than the room needs. He decided to go to the store and swap a few bulbs, so that every room is lit well enough and the total power of the bulbs is as small as possible. The store has bulbs of every positive power. His backpack holds at most $k$ bulbs, so he can swap at most $k$ of them.

A bulb fits any room, so he places the $n$ bulbs into the $n$ rooms in any order he likes, one per room. Find the smallest possible total power of the bulbs in the house after swapping at most $k$ of them and lighting every room well enough.

The first line has two integers $n$ and $k$ ($1 \le k \le n \le 500\,000$), the number of rooms (which is also the number of bulbs) and the number of bulbs that fit in the backpack. Rooms are numbered from $1$ to $n$.

The second line has $n$ integers $p_1, p_2, \dots, p_n$ ($1 \le p_i \le 10^9$), the powers of the bulbs Byteasar owns.

The third line has $n$ integers $w_1, w_2, \dots, w_n$ ($1 \le w_i \le 10^9$), the minimum power each room needs. Room $i$ needs a bulb of power at least $w_i$.

If swapping at most $k$ bulbs cannot light every room well enough, print NIE. Otherwise print one integer, the minimum total power of the bulbs in the house after swapping at most $k$ of them.

In the first example it is enough to swap the bulb of power $2$ for a bulb of power $4$ and the bulb of power $10$ for a bulb of power $4$. Every room except the one that needs power $11$ then holds a bulb of exactly the power it needs, and that room holds a bulb of power $12$.