Farmer John has discovered the Internet is buying bales of hay
online when he notices a special deal. For every bale of hay of
(1 ≤ A
≤ 1,000,000) he buys, he can get a bale of hay of
(1 ≤ B
) for free!
The deal, however, is restricted: the larger bale must be high
quality hay and the smaller one must be low quality hay. FJ, being
a frugal and thrifty fellow, does not care: any quality of hay will
do as long as he saves some money.
Given a list of the sizes of N
(1 ≤ N
≤ 10,000) bales of high
quality hay and M
(1 ≤ M
≤ 10,000) bales of low quality hay, find
the maximum number of bales of hay Farmer John can purchase. He
can buy bales of high quality hay without getting the free bale of
low quality hay, but he cannot buy bales of low quality hay (i.e.,
he must get them for free in the deal).
* Line 1: Two space-separated integers: N
* Lines 2..N
+ 1: Line i
+ 1 contains a single integer which is the size
of the i
-th bale of high quality hay.
* Lines N
+ 2 .. N
+ 1: Line i
+ 1 contains a single integer which is the
size of the i
-th bale of low quality hay.
* Line 1: The maximum total number of bales of hay Farmer John can
There are 3 bales of high quality hay, with sizes 6, 1, and 3, and 4 bales
of low quality hay, with sizes 1, 5, 3, and 4.
Obviously, Farmer John can buy all the bales of high quality hay.
When he buys the size 6 high quality bale, he can get any low quality
bale for free (say, the bale of size 3). When he buys the size 3
high quality bale, he can get the size 1 low quality bale for free.
When he buys the size 1 high quality bale, however, he cannot get
any low quality bales for free (since the size must be strictly
less). The total, no matter how clever FJ is, comes to five bales.