Teamwork（http://noi.openjudge.cn/english/21/）

原文：

描述

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.

翻译：

描述

有N个候选人，每个候选人有一个合作值和工作值，挑选一个候选人的集合，在确保合作值为正的情况下使工作值尽可能大

输入：

第一行：一个正整数N（N小于等与100

接下来的N行，表示第i个候选人的合作值（-100到100）和工作值

输出：

一行包括多个整数，表示候选人的序号