Envío 2198

Código

#include <iostream>
#include <map>
#include <bits/stdc++.h>
using namespace std;

int main() {
    string word;
    int k;
    cin >> word >> k;
    
    map<char, int> map_count;
    int left = 0;
    int shortest = INT_MAX;
    for (int right = 0; right < word.size(); right++) {
        char letter = word[right];
        map_count[letter]++;
        while (map_count.size() >= k) {
            shortest = min(shortest, right - left + 1);
            char left_char = word[left];
            map_count[left_char]--;
            if (map_count[left_char] == 0) {
                map_count.erase(left_char);
            }
            left++;
        }
        

    }
    cout << shortest << endl;
}