这份90分代码还有救吗？讲懂必关

#include <bits/stdc++.h>
using namespace std;
queue <int> q;
map <int,int> dic;
vector <int> v1, v2;
int main() {
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; i++){
       int temp;
       cin >> temp;
       q.push(temp);
       dic[temp]++;
       if(q.size() > k){
           dic[q.front()]--;
           if(dic[q.front()] == 0){
               dic.erase(q.front());
           }
           q.pop();
       }
       if(q.size() == k){
           auto it1 = dic.begin();
           auto it2 = dic.end();
           it2--;
           int MINN = it1 -> first;
           int MAXN = it2 -> first;
           v1.push_back(MINN);
           v2.push_back(MAXN);
       }
    }
    for(int i = 0; i < v1.size(); i++){
        cout << v1[i] << ' ';
    }
    cout << endl;
    for(int i = 0; i < v2.size(); i++){
        cout << v2[i] << ' ';
    }
    return 0;
}