could anyone suggest a simpler stategy for solving the problem:http://codeforces.com/contest/863/problem/B asked 21 Sep '17, 23:22

Just bruteforce it, since $N$ is very small. ($N<= 50$) answered 21 Sep '17, 23:50

You need to minimize total instability, so, firstly sort the array with respect to weight of person. Now traverse this sorted array to find the maximum absolute difference between two consequtive people. These two people will sit on single kayaks.(No contribution to instability.) And remaining people will be divided in groups of two. answered 22 Sep '17, 00:03
