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
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | atcoder_official | 147 |
7 | TheScrasse | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
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
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | I_Hate_Swaps | 2021-09-20 01:01:26 | 313 | Initial revision (published) |
Название |
---|