题目地址:https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH21
Teamwork
团队合作
描述:
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.
这里有N个候选人。每个候选人有合作价值和工作价值。选择一部分候选人组成一个团队,这样,合作价值之和为正,工作价值之和为最大。
输入:
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.
第一行:一个正整数N(N <= 100).
接下来的N行:第i行包括两个整数(在-100到100之间),代表第i个候选人的合作价值和工作价值。
输出:
One line contains several integers, indicating the indexes of selected candidates.
一行包括几个整数,代表被选择的候选人的索引。
样例输入:
4 2 -1 4 -2 1 1
样例输出:
2 3 4
提交