There is no need to sort. It can be done in O(n) with some greedy calculation. My solution is here: SleepyBrain
Read more… (21 words)
Active In
Competitive Programming
Machine Learning
Algorithms and Data Structures
ACM International Collegiate Programming Contest
Artificial Intelligence
Deep Learning
International Mathematics Olympiad
Featured Contributions
NaN.
discussion
[INOI1201] Triathlon (INOI 2012: India)
Problem in short: There are N people, and person i takes a[i], b[i] and c[i] time to do task a, b, c respectively. Only one person can do task a at a given point of time, and each person must ...
Read more…(108 words)
reply in this discussion