Check this one please

general
1

first read the problem statement guys
The Head Chef is studying the motivation and satisfaction level of his chefs . The motivation and satisfaction of a Chef can be represented as an integer . The Head Chef wants to know the N th smallest sum of one satisfaction value and one motivation value for various values of N . The satisfaction and motivation values may correspond to the same chef or different chefs . Given two arrays, the first array denoting the motivation value and the second array denoting the satisfaction value of the chefs . We can get a set of sums(add one element from the first array and one from the second). For each query ( denoted by an integer qi ( i = 1 to Q ) , Q denotes number of queries ) , find the qi th element in the set of sums ( in non-decreasing order ) .

Input

  • The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
  • The first line of each test case contains a two space seperated integers K and Q denoting the number of chefs and the number of queries .
  • The second line of each test case contains K space-separated integers A1, A2, …, AK denoting the motivation of Chefs.
  • The third line of each test case contains K space-separated integers B1, B2, …, BK denoting the satisfaction of Chefs.
  • The next Q lines contain a single integer qi ( for i = 1 to Q ) , find the qi th element in the set of sums .

Output

  • For each query of each test case, output a single line containing the answer to the query of the testcase

include <bits/stdc++.h>
using namespace std;

int main() {
// your code goes here
int t;
cin>>t;

while(t--){
    int k,q;
    cin>>k>>q;
    
    long long a[k],b[k];
    
    for(int i=0; i<k; i++){
        cin>>a[i];
    }
    for(int i=0; i<k; i++){
        cin>>b[i];
    }
    sort(a,a+k);
    sort(b,b+k);
    vector<long long> v;
    for(int i=0; i<min(k,10001); i++){
        for(int j=0; j<min(k,10001/(i+1)); j++){
            v.push_back(a[i]+b[j]);
        }
    }
    sort(v.begin(),v.end());
    
    while(q--){
        long long qq;
        cin>>qq;
        
        cout<<v[qq-1]<<endl;
        
        
    }
    
}

}
can anybody explain why this solution works like how j<10001/i+1 is getting accepted i am not able to find the answer for this thing.
given constraints are

  • 1 ≤ T ≤ 5
  • 1 ≤ K ≤ 20000
  • 1 ≤ Q ≤ 500
  • 1 ≤ qi ( for i = 1 to Q ) ≤ 10000
  • 1 ≤ Ai ≤ 10^18 ( for i = 1 to K )
  • 1 ≤ Bi ≤ 10^18 ( for i = 1 to K )