It does not have to be 100% optimized, however the rules do state
quote:
More precisely, given a comma-delimited list of arbitrary indices, songList, find an array of indices, indexList, such that
  • sum(songList(indexList)) <= mediaLength, and
  • gap = (mediaLength - sum(songList(indexList))) / mediaLength is minimized.
Without this requirement I could just return one song per CD and achieve a low KiXGolf score. [Wink]
_________________________
There are two types of vessels, submarines and targets.