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
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | nor | 155 |
5 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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
Name |
---|
Just check for a subsequence with length K and highest sum. i.e check if the largest k numbers have a sum greater than S.