good array

good_array.cpp

// An array A[i] of size N and a single integer K are given.You must create a good array G[i] of size N.The good array G[i] is the array in which the i ^ (th) elementdenotes the number of elements of the array present betweenrange A[i] - K, A[i] + K ] (inclusively).
// Find the good array G[i] of size N.

vector<int> solve(vector<int> &v, int &k){
    auto s = v;
    sort(s.begin(), s.end());
    vector<int> ans;
    for(auto num: v){
        auto lp = lower_bound(s.begin(), s.end(), num-k) - s.begin();
        auto hp = lower_bound(s.begin(), s.end(), num+k+1) - s.begin();
        ans.push_back(hp-lp);
    }
    return ans;
}
int main() {
    int n ,k;
    cin>>n>>k;
    vector<int> v(n);
    for(int i=0; i<n; i++) cin>>v[i];
    for(auto num: solve(v, k)) cout<<num<<", ";
}