题目:
Teamwork
1000ms 65536K
描述:
There are N candidates. Each candidate has a cooperation value and a working value. Select a subset of candidates to form a team, such that the sum of cooperation values is positive and the sum of working values is maximum.
输入:
First line: one positive integer N (N <= 100).
Next N lines: the i-th line contains two integers (between -100 and 100), indicating the cooperation value and the working value of the i-th candidate.
输出:
One line contains several integers, indicating the indexes of selected candidates.
样例输入:
4 2 -1 4 -2 1 1
样例输出:
2 3 4
翻译:
描述:
有N个候选人,每个候选人有一个团队价值和工作价值,选择候选人其中一部分人组成一个团队,使得团队总价值是正数,并且总的工作价值最大。
输入:
第一行:一个正整数N(N <= 100).
接下来的N行:第i行包含两个整数(在-100到100之间),表示第i个候选人的团队价值和工作价值。
输出:
一行包含几个整数,表示被选中的候选人的索引。