Codeforces Round #643 (Div. 2) 1355B - Young Explorers Solution

Problem Link  :  https://codeforces.com/contest/1355/problem/B 

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

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

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long n,t,i,r,a,ans,mv;

    cin>>t;

    while(t--)

    {

        cin>>n;

        vector<long long>v;

        map<long long,long long>mp;

        for(i=0; i<n; i++)

        {

            cin>>a;

            mp[a]++;

            if(mp[a]==1)v.push_back(a);

        }

        ans=mv=0;

        sort(v.begin(),v.end());

        for(i=0; i<v.size(); i++)

        {

            ans+=(mv+mp[v[i]])/(v[i]);

            mv=((mv+mp[v[i]])%v[i]);

        }

        cout<<ans<<endl;

    }

}