Codeforces div3 Zero Quantity Maximization （map+pair存儲分數）

You are given two arrays a a and b b , each contains n n integers. You want to create a new array c c as follows: choose some real (i.e. not necessarily integer) number d d , and then for every i∈[1,n

>>阅读原文<<