#include <bits/stdc++.h>
struct solve {
  int aa;
  int bb;
};
void merge(struct solve arr[], int l, int m, int r) {
  int i, j, k;
  int n1 = m - l + 1;
  int n2 = r - m;
  struct solve L[n1], R[n2];
  for (i = 0; i < n1; i++) L[i] = arr[l + i];
  for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
  i = 0;
  j = 0;
  k = l;
  while (i < n1 && j < n2) {
    if (L[i].aa <= R[j].aa) {
      if (L[i].aa == R[j].aa) {
        if (L[i].bb <= R[j].bb) {
          arr[k] = L[i];
          i++;
        } else {
          arr[k] = R[j];
          j++;
        }
      } else {
        arr[k] = L[i];
        i++;
      }
    } else {
      arr[k] = R[j];
      j++;
    }
    k++;
  }
  while (i < n1) {
    arr[k] = L[i];
    i++;
    k++;
  }
  while (j < n2) {
    arr[k] = R[j];
    j++;
    k++;
  }
}
void mergeSort(struct solve arr[], int l, int r) {
  if (l < r) {
    int m = l + (r - l) / 2;
    mergeSort(arr, l, m);
    mergeSort(arr, m + 1, r);
    merge(arr, l, m, r);
  }
}
long long int min(long long int a, long long int b) { return a < b ? a : b; }
long long int max(long long int a, long long int b) { return a > b ? a : b; }
int main() {
  int T;
  scanf("%d", &T);
  for (int C = 0; C < T; C++) {
    int n;
    scanf("%d", &n);
    struct solve S[n];
    long long int bsum[n];
    for (int i = 0; i < n; i++) {
      scanf("%d", &S[i].aa);
    }
    for (int i = 0; i < n; i++) {
      scanf("%d", &S[i].bb);
    }
    mergeSort(S, 0, n - 1);
    long long int s = 0;
    for (int i = 0; i < n; i++) {
      s += S[n - i - 1].bb;
      bsum[i] = s;
    }
    long long int ans = S[n - 1].aa;
    for (int i = 0; i < n - 1; i++) {
      ans = min(ans, max(S[n - 2 - i].aa, bsum[i]));
    }
    ans = min(ans, bsum[n - 1]);
    printf("%d\n", ans);
  }
  return 0;
}
