Go: package main

import (
	"bufio"
		"os"
	"strconv"
	"strings"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)
var f = make([]string, 10)
var s, w = make([]int, 10), make([]int, 10)
var n int
func main() {
	for scanner.Scan() {
		n, _ = strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			tmpf :=buf[0]
			tmpw, _ := strconv.Atoi(buf[1])
			tmps, _ := strconv.Atoi(buf[2])
			f[i] = tmpf
			s[i] = tmps
			w[i] = tmpw
		}
		sort()
		for i := 0; i < n; i++ {
			for j := 0; j < n-1; j++ {
				if w[j]<w[j+1] {
					swap(j)
					a := get_weight(j+1)
					if a>s[j] {
						swap(j)
					}
				}
			}
		}
		for i := 0; i < n; i++ {
			fmt.Println(f[i])
		}
	}
}

func sort() {
	for i := n-1; i > 0; i-- {
		for j := 0; j < i; j++ {
			if s[j]<s[j+1] {
				swap(j)
			} else if s[j]==s[j+1]&&w[j]<w[j+1] {
				swap(j)
			}
		}
	}
}

func swap(x int) {
	w[x], w[x+1] = w[x+1], w[x]
	s[x], s[x+1] = s[x+1], s[x]
	f[x], f[x+1] = f[x+1], f[x]
}

func get_weight(x int) int {
	ret := 0
	for i := x; i < n; i++ {
		ret += w[i]
	}
	return ret
}

C++: 
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <cfloat>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int DX[] = {0, 1, 0, -1};
const int DY[] = {-1, 0, 1, 0};


//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

struct Food{
	string name;
	int w;
	int s;
	int id;
	Food(string name, int w, int s, int id): name(name), w(w), s(s), id(id) {};

	bool operator<(const Food& rhs) const{
		return id < rhs.id;
	}
};

double calc(vector<Food> foods){
	int length= foods.size();
	int sum = 0;
	for(int i = length - 1; i >= 0; --i){
		int s = foods[i].s;
		if(s < sum) return DBL_MAX;
		sum += foods[i].w;
	}
	double d = 0, n = 0;
	REP(i, length){
		n += (i + 1) * foods[i].w;
		d +=foods[i].w;
	}
	return n / d;
}

int main(int argc, char const *argv[])
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;
	vector<Food> ans;
	while(cin >> n, n){
		vector<Food> foods;
		REP(i, n){
			string name;
			int w, s;
			cin >> name >> w >> s;
			foods.emplace_back(name, w, s, i);
		}
		double min = DBL_MAX;
		do{
			double value = calc(foods);
			if(min > value){
				min = value;
				ans = foods;
			}
		}while(next_permutation(foods.begin(), foods.end()));
		REP(i, n)
			cout << ans[i].name << endl;
	};
	return 0;
}

C++: // 2011/02/06 Tazoe

#include <iostream>
#include <string>
using namespace std;

struct food{
	string f;
	int w;
	int s;
};

int main()
{
	while(true){
		int n;
		cin >> n;
		if(n==0)
			break;

		struct food F[10];
		for(int i=0; i<n; i++)
			cin >> F[i].f >> F[i].w >> F[i].s;

		for(int i=0; i<n-1; i++)
			for(int j=i+1; j<n; j++)
				if(F[i].w<F[j].w){
					struct food tmp = F[i];
					F[i] = F[j];
					F[j] = tmp;
				}

		for(int i=0; i<n-1; i++){
			int sum = 0;
			for(int j=i+1; j<n; j++)
				sum += F[j].w;

			if(F[i].s>=sum)
				continue;

			int k;
			for(k=i+1; k<n; k++)
				if(F[k].s>=sum+F[i].w-F[k].w)
					break;

			struct food tmp = F[k];
			for(int j=k; j>i; j--)
				F[j] = F[j-1];
			F[i] = tmp;
		}

		for(int i=0; i<n; i++)
			cout << F[i].f << endl;
	}

	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;

struct food{
	string n;
	int w;
	int s;
	int used;
};

int main(){
	int n;
	while(cin >> n){
		vector<food> vf;
		if(n == 0 ) break;
		for(int i = 0; i < n; i++){
			food f;
			cin >> f.n >> f.w >> f.s;
			f.used = 0;
			vf.push_back(f);
		}
		int weight = 0;
		for(int i = 0; i < n; i++) weight += vf[i].w;
		for(int i = 0; i < n; i++){
			vector<int> vi;
			for(int j = 0; j < n; j++){
				if(!vf[j].used && vf[j].s >= weight - vf[j].w){
					vi.push_back(j);
				}
			}
			int wmax = -1;
			int u;
			for(int j = 0; j < vi.size(); j++){
				if(wmax <vf[vi[j]].w){
					wmax = vf[vi[j]].w;
					u = vi[j];
				}
			}
			cout << vf[u].n << endl;
			vf[u].used = 1;
			weight -= vf[u].w;
		}
	}
	return 0;
}