Editorial for TLE '16 Contest 6 (Mock CCC) J2 - Carol's Flowers

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.

Submitting an official solution before solving the problem yourself is a bannable offence.

First, sort the flowers from least to greatest, then starting at the N^{th} flower, start adding downwards. i.e.: F[N]^1+F[N-1]^2+\dots+F[1]^N where F is the array of all flowers at the shop.

Time complexity: \mathcal{O}(F \log F)


There are no comments at the moment.