1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cmath>
 5 #include <vector>
 6 #include <ctime>
 7 #include <map>
 8 #include <stack>
 9 #include <queue>
10 #include <cstring>
11 #include <algorithm>
12 using namespace std;
13 
14 #define sacnf scanf
15 #define scnaf scanf
16 #define maxn  20
17 #define maxm 26
18 #define inf 1061109567
19 #define Eps 0.00001
20 const double PI=acos(-1.0);
21 #define mod 1000033
22 #define MAXNUM 10000
23 void Swap(int &a,int &b) {int t=a;a=b;b=t;}
24 int Abs(int x) {return (x<0)?-x:x;}
25 typedef long long ll;
26 typedef unsigned int uint;
27 
28 struct node
29 {
30     char name[110];
31     int d,c;
32     bool operator < (const node &a) const
33     {
34         int len1=strlen(name);
35         int len2=strlen(a.name);
36         int len=min(len1,len2);
37         for(int i=0;i<len;i++)
38         {
39             if(name[i]<a.name[i]) return true;
40             else if(name[i]>a.name[i]) return false;
41         }
42         return len1<len2;
43     }
44 } a[maxn];
45 
46 int p[maxn],vis[maxn],n;
47 int ans[1<<15],tpath[maxn],path[maxn];
48 
49 void dfs(int stat,int cnt,int val,int tme)
50 {
51     if(ans[stat]<val) return;
52     else if(ans[stat]>val&&cnt==n)
53     {
54         ans[stat]=val;
55         for(int i=1;i<=n;i++) path[i]=tpath[i];
56         return;
57     }
58     ans[stat]=val;
59     if(cnt==n) return;
60     for(int i=0;i<n;i++)
61     {
62         if(!vis[i])
63         {
64             vis[i]=1;tpath[cnt+1]=i;
65             dfs(stat^p[i],cnt+1,val+((tme+a[i].c<=a[i].d)?0:tme+a[i].c-a[i].d),tme+a[i].c);
66             vis[i]=0;
67         }
68     }
69 }
70 
71 int main()
72 {
73     //freopen("data.in","r",stdin);
74     //freopen("data.out","w",stdout);
75     //clock_t st=clock();
76     int T;scanf("%d",&T);
77     p[0]=1;for(int i=1;i<=15;i++) p[i]=p[i-1]*2;
78     while(T--)
79     {
80         scanf("%d",&n);
81         for(int i=1;i<(1<<n);i++) ans[i]=inf;
82         for(int i=0;i<n;i++)
83         {
84             scanf("%s%d%d",a[i].name,&a[i].d,&a[i].c);
85         }
86         sort(a,a+n);
87         for(int i=0;i<n;i++)
88             vis[i]=1,tpath[1]=i,dfs((1<<i),1,(a[i].c<=a[i].d)?0:a[i].c-a[i].d,a[i].c),vis[i]=0;
89         printf("%d\n",ans[(1<<n)-1]);
90         for(int i=1;i<=n;i++)
91         {
92             printf("%s\n",a[path[i]].name);
93         }
94     }
95     //clock_t ed=clock();
96     //printf("\n\nTime Used : %.5lf Ms.\n",(double)(ed-st)/CLOCKS_PER_SEC);
97     return 0;
98 }