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 | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
2 | adamant | 163 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | TheScrasse | 147 |
7 | atcoder_official | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
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.