given an array of length n, find the sum of all elements and subtract the median of the array. print the answer
constraints are 0 < n < 10^20
each element is 0 < element < 10^21
if you can’t solve this, UPVOTE THIS
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
given an array of length n, find the sum of all elements and subtract the median of the array. print the answer
constraints are 0 < n < 10^20
each element is 0 < element < 10^21
if you can’t solve this, UPVOTE THIS
Name |
---|
Auto comment: topic has been updated by poggers12345 (previous revision, new revision, compare).
Guess what?
DownVoted ✪ω✪ again ✪ω✪
I know (and I hope everyone else also knows) that this has to be a troll post. Regardless of that, I couldn't resist the urge to calculate how much time and space it would take to generate and store the maximum inputs.
A simple maximal input where
Unable to parse markup [type=CF_MATHJAX]
and eachUnable to parse markup [type=CF_MATHJAX]
would take aroundUnable to parse markup [type=CF_MATHJAX]
years to generate on a basic laptop with c++, and it would take aroundUnable to parse markup [type=CF_MATHJAX]
terabytes of storage.Alas, I have to be honest: I cannot solve this problem. I upvoted.
Sir, do you know how long it would take to input the entire array?
It would be much appreciated if you tried and exploded your computer!
I CANT SOLVE THIS!!!!!