Please help me to solve this problem :
Given an array A containing n non-negative integers, check if there exists any subsequence of length exactly equal to K such that its sum is atleast S
Constraints:
1<=n<=1e5
1<=k<=n
0<=A[i]<=1e9
0<=S<=1e11
A Subsequence Problem
Please help me to solve this problem :
Given an array A containing n non-negative integers, check if there exists any subsequence of length exactly equal to K such that its sum is atleast S
Constraints:
1<=n<=1e5
1<=k<=n
0<=A[i]<=1e9
0<=S<=1e11