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;
		foods.reserve(n);
		string name;
		int w, s;
		REP(i, n){
			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++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const int MOD=1e9+7;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  while(true){
      cin>>n;
      if(n==0) break;
      std::vector<string> f(n);
      std::vector<int> w(n),s(n),v(n),res(n);
      for(int i=0;i<n;i++) cin>>f[i]>>w[i]>>s[i];
      for(int i=0;i<n;i++) v[i]=i;
      double mi=INF;
      do{
          double g=0,sum=0;
          for(int i=1;i<=n;i++){
              g+=i*w[v[i-1]];
              sum+=w[v[i-1]];
          }
          g/=sum;
          bool flag=true;
          for(int i=0;i<n;i++){
              int wa=0;
              for(int j=i+1;j<n;j++) wa+=w[v[j]];
              if(s[v[i]]<wa) flag=false;
          }
          if(flag){
              if(g<mi){
                  for(int i=0;i<n;i++) res[i]=v[i];
              }
          }
      }while(next_permutation(v.begin(),v.end()));
      for(int i=0;i<n;i++) cout<<f[res[i]]<<endl;
  }
}

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

string f[11];
int ans[11];
int n;
int w[11],s[11];

void solve(){
	for(int i=1; i<=n; i++)
		ans[i] = i;
	for(int k=1; k<=n; k++){
		for(int i=n; i>k; i--){
			if(s[ans[i]] > s[ans[i-1]]){
				int tmp = ans[i];
				ans[i] = ans[i-1];
				ans[i-1] = tmp;
			}
		}
	}
	bool flag = true;
	for(int i=1; i<=n; i++){
		if(i==n&&!flag){
			i=1;
			flag = true;
		}else if(i==n)
			break;
		if(w[ans[i]] < w[ans[i+1]]){
			int tmp = w[ans[i]];
			for(int k=i+2; k<=n; k++)
				tmp += w[ans[k]];
			if(s[ans[i+1]] >= tmp){
				tmp = ans[i];
				ans[i] = ans[i+1];
				ans[i+1] = tmp;
				flag = false;
			}
		}
	}
}

int main(){
	while(true){
		cin >> n;
		if(!n)
			return 0;
		for(int i=1; i<=n; i++)
			cin >> f[i] >> w[i] >> s[i];
		solve();
		for(int i=1; i<=n; i++)
			cout << f[ans[i]] << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(2e5 + 5);
const double EPS = 1e-8;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()

int main() {
    while(1){
        int n, w[15], s[15], mi=IINF;
        string f[15];
        vector<int> v, ans;
        cin >> n;
        if(n==0)break;
        REP(i,n){
            cin >> f[i] >> w[i] >> s[i];
            v.push_back(i);
        }
        while(1){
            int cum[15]{}, tmp=0;
            REP(i,n) cum[i+1] += cum[i] + w[v[i]];
            bool ok = true;
            REP(i,n) ok &= s[v[i]] >= cum[n]-cum[i+1];
            if(ok){
                REP(i,n){
                    tmp += w[v[i]]*(i+1);
                }
                if(tmp < mi){
                    mi = tmp;
                    ans = v;
                }
            }
            if(!next_permutation(ALL(v)))break;
        }
        for(auto i : ans){
            cout << f[i] << endl;
        }
    }
    return 0;
}