Given a chocolate shop with chocolates priced from 1 to 10^9 consecutively. A student visits the shop for K consecutive days and buys chocolates indexed at (A1,A2,A3...An) on each day. You are given an array 'A' representing the chocolate indexes the student buys each day. Determine the minimum priced chocolate remaining in your shop after the kth day. ↵
↵
Constraints—↵
↵
1 <= N <= 500↵
↵
1 <= A[i] < 10^9↵
↵
1<=K<=10^5↵
↵
Sample Test cases -↵
↵
A = [1,3,5,7,9]↵
↵
k = 3↵
↵
O/P — 8.↵
↵
Explanation -↵
on 1st day— 1st , 3rd , 5th , 7th and 9th chocolate is removed. So the chocolate set becomes — ↵
(1,2,3,4,5,6,7,8,9.....10^9) ---> (2,4,6,8,10,11,12....10^9)↵
↵
on 2nd day — again 1st , 3rd , 5th , 7th and 9th chocolate is removed. So the chocolate set becomes — ↵
(2,4,6,8,10,11,12....10^9) ---> (4,8,11,13,15,16,17....10^9) ↵
↵
on 3rd day — again 1st , 3rd , 5th , 7th and 9th chocolate is removed. So the chocolate set becomes — ↵
(4,8,11,13,15,16,17....10^9) ---> (8,13,16,18,20,21,22....10^9)↵
↵
Minimum priced chocolate after 3rd day is 8.↵
↵
Constraints
↵
1 <= N <= 500↵
↵
1 <= A[i] < 10^9↵
↵
1<=K<=10^5↵
↵
Sample Test cases -↵
↵
A = [1,3,5,7,9]↵
↵
k = 3↵
↵
O/P — 8
↵
Explanation -↵
on 1st day
(1,2,3,4,5,6,7,8,9.....10^9) ---> (2,4,6,8,10,11,12....10^9)↵
↵
on 2nd day — again 1st , 3rd , 5th , 7th and 9th chocolate is removed. So the chocolate set becomes — ↵
(2,4,6,8,10,11,12....10^9) ---> (4,8,11,13,15,16,17....10^9) ↵
↵
on 3rd day — again 1st , 3rd , 5th , 7th and 9th chocolate is removed. So the chocolate set becomes — ↵
(4,8,11,13,15,16,17....10^9) ---> (8,13,16,18,20,21,22....10^9)↵
↵
Minimum priced chocolate after 3rd day is 8.↵
