Archivist inherited the counting house at the honey farms of Buzzwell along with its curious bookkeeping system for segments. Time to make sense of it. Task: Print the number of index pairs (i,j), i<j, with a[i]+a[j] <= k. Input format: First line: n and k. Second line: n integers. Output format: Print the pair count (fits 64-bit). Constraints: 2 <= n <= 3310; -1000000 <= a[i],k <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 3310; -1000000 <= a[i],k <= 1000000000.
