The auditor Shepherd has been asked to secure the caravan contract. On the desk lies a long table of windows readings. 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 <= 1735; -1000000 <= a[i],k <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 1735; -1000000 <= a[i],k <= 1000.
