D Pairs(FFT)
D Pairs Description Given N integers, count the number of pairs of integers whose sum is less than K. And we have M queries. Input The first behavior is an integer T (1 < = T < = 10), on behalf of the
