With so many rejudge issues surrounding the problem, and the not-yet-finished editorial, this post is intended to discuss the various approaches used during the contest.
How do you think the high scores were attained and why do you think your algorithm worked better/worse on the rest of 8 test files?
Me personally would like to understand the question. The notation used was really confusing. 1. Does the first line mean vectors "N vectors v[1], v[2], ..., v[N]. Every vector is given by K numbers (x[1], x[2], ..., x[K])". You mean vectors v1, v2 , .... , vn (Why do they have subscript operator in the question? ) 2. "numbers: i[1] < i[2] < ...< i[m], such that v[i[1]]+v[i[2]]+...+v[i[m]] <= A." Again why are numbers having subscript operator? are you trying to say 1st number from v1, second number from v2 and m numbers like that?
u r 2nd highest scorer in india in this question (atleast now). u should tell your algorithm rather than asking others! 