| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | Um_nik | 162 |
| 3 | atcoder_official | 160 |
| 3 | maomao90 | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | adamant | 154 |
| 7 | Dominater069 | 154 |
| 9 | awoo | 152 |
| 9 | luogu_official | 152 |
Number of ways of dividing an array into 2 parts such that sum of each part is > k
I got this problem in an off-campus round, someone please help me solve the problem:
You are given N elements, each having unique values. If you distribute them among 2 children in such a way that the total unique value that each child receives must be greater than K. How many ways can you distribute the elements so that the mentioned condition holds true?
Since the answer can be very large print it modulo 1e9+7.
1 <= N <= 10^3
1 <= K <= 10^5
1 <= A[i] <= 10^9
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
DaviddeGea1 | 2019-10-27 12:01:03 | 99 | ||
| en1 |
|
DaviddeGea1 | 2019-10-27 11:54:36 | 565 | Initial revision (published) |
