Morning light hits the ivy courts of Vineward as Botanist unrolls the day's manifest of ledgers. The tally will decide the next shipment. Task: The array is sorted non-decreasing. Print the 1-based position where x would be inserted to keep the order (before equal values). Input format: First line: n and x. Second line: n sorted integers. Output format: Print the insertion position (1..n+1). Constraints: 1 <= n <= 5337; -1000000 <= a[i],x <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 5337; -1000000 <= a[i],x <= 1000000.
