output_description: Print T lines. The i-th line should contain the answer to the i-th test case.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      T
      \mathrm{case}_1
      \vdots
      \mathrm{case}_T
      
  
  Each case is given in the following format:
  
      
      
      N
      K_1 L_1 R_1
      \vdots
      K_N L_N R_N
attempt: t = int(input())
  
  nlist = []
  klists = []
  
  for i in range(t):
      n = int(input())
      nlist.append(n)
      klist = []
      for j in range(n):
          klist.append(input())
      klists.append(klist)
  
  for i in range(t):
      n = nlist[i]
      klist = klists[i]
  
      l_list = []
      r_list = []
      for j in range(n):
          k, l, r = map(int, klist[j].split())
          if l - r > 0:
              l_list.append([k, l, r])
          else:
              r_list.append([k, l, r])
  
      l_list.sort(key=lambda x: (x[1] - x[2]), reverse=True)
      l_list.sort(key=lambda x: x[0])
      r_list.sort(key=lambda x: (x[1] - x[2]), reverse=True)
      r_list.sort(key=lambda x: x[0])
  
      l_list.extend(r_list)
  
      sort_list = l_list
      ans_list = []
      temp_list = []
      for j in range(n):
          while sort_list != [] and sort_list[0][0] <= j + 1:
              temp_list.append(sort_list[0])
              sort_list.pop(0)
  
          temp_list.sort(key=lambda x: (x[1] - x[2]), reverse=True)
  
          while temp_list != [] and len(ans_list) < j + 1:
              ans_list.append(temp_list[0])
              temp_list.pop(0)
  
      while temp_list != []:
          ans_list.append(temp_list[0])
          temp_list.pop(0)
  
      sum = 0
      for j in range(n):
          if ans_list[j][0] >= j + 1:
              sum += ans_list[j][1]
          else:
              sum += ans_list[j][2]
      print(sum)
  
problem_description: Statement
  
  We have N camels numbered 1,2,\ldots,N. Snuke has decided to make them line up
  in a row.
  
  The happiness of Camel i will be L_i if it is among the K_i frontmost camels,
  and R_i otherwise.
  
  Snuke wants to maximize the total happiness of the camels. Find the maximum
  possible total happiness of the camel.
  
  Solve this problem for each of the T test cases given.
samples: [{"input": "3\n    2\n    1 5 10\n    2 15 5\n    3\n    2 93 78\n    1 71 59\n    3 57 96\n    19\n    19 23 16\n    5 90 13\n    12 85 70\n    19 67 78\n    12 16 60\n    18 48 28\n    5 4 24\n    12 97 97\n    4 57 87\n    19 91 74\n    18 100 76\n    7 86 46\n    9 100 57\n    3 76 73\n    6 84 93\n    1 6 84\n    11 75 94\n    19 15 3\n    12 11 34", "output": "25\n    221\n    1354\n    \n\n  * In the first test case, it is optimal to line up the camels in the order 2, 1.\n    * Camel 1 is not the frontmost camel, so its happiness will be 10.\n    * Camel 2 is among the two frontmost camels, so its happiness will be 15.\n  * In the second test case, it is optimal to line up the camels in the order 2, 1, 3.\n    * Camel 1 is among the two frontmost camels, so its happiness will be 93.\n    * Camel 2 is the frontmost camel, so its happiness will be 71.\n    * Camel 3 is among the three frontmost camels, so its happiness will be 57."}]