Codeforces Round #813 (Div. 2) 1712A. Wonderful Permutation Solution

 

Problem Link: https://codeforces.com/contest/1712/problem/A

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int t;

    cin>>t;

    while(t--)

    {

        int n,k,ar[1000];

        cin>>n>>k;

        for(int i=0; i<n; i++)cin>>ar[i];

        int cn=0;

        for(int i=0; i<k; i++)

        {

            if(ar[i]>k)cn++;

        }

        if(is_sorted(ar,ar+n))

            cout<<"0"<<endl;

        else

            cout<<cn<<endl;

    }

    return 0;

}