vector<int> largestPermutation(int k, vector<int> arr) {
    vector<int> cparr; cparr = arr;
    sort(cparr.rbegin(), cparr.rend());
    long count = 0; 
    for (long i = 0; i < cparr.size(); i++){
        if (count == k){break;}
        for (long j = i; j < arr.size(); j++){
            if (arr[j] == cparr[i] && i != j){
                swap(arr[i],arr[j]);count++;
                break;
            }
        }
    }
    return arr;
}

vector<int> largestPermutation(int k, vector<int> arr) {
    int n=arr.size();
    map<int,int>mp;
    for(int i=0;i<n;i++){
        mp.insert({arr[i],i});
    }
    vector<int> a(arr);
    sort(a.begin(),a.end());
    int swp=0;
    for(int i=0;i<n-1;i++){
        int max_e=a[a.size()-1];
        int max_i=mp[max_e];
        a.pop_back();
        if(max_i==i) continue;
        else{
            swp++;
            swap(arr[i],arr[max_i]);
            mp[arr[i]]=i;
            mp[arr[max_i]]=max_i;
        }
        if(swp==k)break;    
    }
    return arr;
}

    let map=new Map();
    for(let i=0;i<arr.length;i++){
        map.set(arr[i],i);
    }
    let n=arr.length;
    let i=0;
    while(k!=0 && n>0){                     //1
       let val=arr[i];               //2
       if(n>val){                    //2
           arr[i]=n;                 //
           arr[map.get(n)]=val
           map.set(val,map.get(n));
           map.delete(n);
           k--;
       }
       i++;
       n--; 
    }
    return arr;

def largestPermutation(k, arr):
    n = len(arr)
    d = {arr[i]: i for i in range(n)}
    for i in range(n):
        if k == 0:
            break
        if arr[i] == n - i:
            continue
        j = d[n - i]
        arr[i], arr[j] = arr[j], arr[i]
        d[arr[i]], d[arr[j]] = i, j
        k -= 1
    return arr