import Data.Function (on)
import Data.List (sortBy, groupBy, minimumBy)
import Data.Ord (comparing)
(|>) x f = f x
 
solve xs ys = 
	let partialSum s (y,x) = s - x *2 + 1 in
	zip ys xs
	|> sortBy (comparing fst)
	|> groupBy (on (==) fst)
	|> scanl (\s x -> (fst s + foldl partialSum 0 x, fst $ head x)) (foldl1 (+) xs, minimum ys - 1)
	|> minimumBy (comparing fst)
	|> snd
 
x1 = [0, 0, 0, 1, 1, 1] 
y1 = [6, 3, 4, 4, 4, 2.1] 
main = print $ solve x1 y1

aW1wb3J0IERhdGEuRnVuY3Rpb24gKG9uKQppbXBvcnQgRGF0YS5MaXN0IChzb3J0QnksIGdyb3VwQnksIG1pbmltdW1CeSkKaW1wb3J0IERhdGEuT3JkIChjb21wYXJpbmcpCih8PikgeCBmID0gZiB4Cgpzb2x2ZSB4cyB5cyA9IAoJbGV0IHBhcnRpYWxTdW0gcyAoeSx4KSA9IHMgLSB4ICoyICsgMSBpbgoJemlwIHlzIHhzCgl8PiBzb3J0QnkgKGNvbXBhcmluZyBmc3QpCgl8PiBncm91cEJ5IChvbiAoPT0pIGZzdCkKCXw+IHNjYW5sIChccyB4IC0+IChmc3QgcyArIGZvbGRsIHBhcnRpYWxTdW0gMCB4LCBmc3QgJCBoZWFkIHgpKSAoZm9sZGwxICgrKSB4cywgbWluaW11bSB5cyAtIDEpCgl8PiBtaW5pbXVtQnkgKGNvbXBhcmluZyBmc3QpCgl8PiBzbmQKCQp4MSA9IFswLCAwLCAwLCAxLCAxLCAxXSAKeTEgPSBbNiwgMywgNCwgNCwgNCwgMi4xXSAKbWFpbiA9IHByaW50ICQgc29sdmUgeDEgeTE=