Smallest subarray with k distinct numbers

//n= size of array
//k= size of the length/unique element number/the size where you want to find most of the unique number

void minRange(long long arr[], long long n, long long k)
{
    ll l = 0, r = n;
    for (ll i = 0; i < n; i++) {
        unordered_set<ll> s;
        ll j;
        for (j = i; j < n; j++) {
            s.insert(arr[j]);
            if (s.size() == k) {
                if ((j - i) < (r - l)) {
                    r = j;
                    l = i;
                }
                break;
            }
        }
        if (j == n)
            break;
    }
        cout << l << " " << r<<endl;
}