CUBE-194: Déjà vu

#include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long int ll;

struct elem{
    ll val;
    ll pos;
};

bool mycmp(elem a,elem b){
    return a.val < b.val;
}

int main()
{
    int n,k;
    scanf("%d %d",&n,&k);
    ll des[n];
    for(int i = 0 ; i < n ; i ++){
        scanf("%lld",&des[i]);
    }
    elem arr[k];
    for(int i = 0 ; i < k ; i ++){
        ll v;
        scanf("%lld",&v);
        arr[i] = {v,i};
    }
    sort(des,des+n);
    sort(arr,arr+k,mycmp);
    int idx = 0;
    int j = 0;
    ll sum = 0;
    ll ans[k];
    while(idx < k){
        while(j < n && des[j] <= arr[idx].val + sum){
            sum++;
            j++;
        }
        ans[arr[idx].pos] = arr[idx].val + sum;
    //  printf("%lld ",arr[idx].val + sum);
        idx++;
    }
    for(int i = 0 ; i < k ; i ++){
        printf("%lld ",ans[i]);
    }
    return 0;
}