In the saffron fields of Marigold Row, Curator the assayer keeps careful count of the crates. balance the workshop's books, every figure matters. Task: Among all pairs of distinct elements, print the pair sum that is closest to k. If several tie, print the smaller sum. Input format: First line: n and k. Second line: n integers. Output format: Print the closest achievable pair sum. Constraints: 2 <= n <= 3056; 0 <= a[i],k <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 3056; 0 <= a[i],k <= 1000000.
