func_code_string: #include <bits/stdc++.h>   using namespace std;   int n, excluidos = 0;   vector<priority_queue<int, vector<int>, greater<int>>> Vpq;   bool umVazio() {     for (auto u : Vpq) {       if (u.size() == 0) return true;     }     return false;   }   int procura(int indAnterior, int i) {     int num = -1;     while (Vpq[i].size() != 0) {       if (Vpq[i].top() > indAnterior) {         num = Vpq[i].top();         Vpq[i].pop();         return num;       } else {         excluidos++;         Vpq[i].pop();       }     }     return num;   }   int main() {     cin.tie(nullptr);     ios_base::sync_with_stdio(0);     cin >> n;     int a;     Vpq.resize(6);     for (int i = 0; i < n; i++) {       cin >> a;       if (a == 4) {         Vpq[0].push(i);       } else if (a == 8) {         Vpq[1].push(i);       } else if (a == 15) {         Vpq[2].push(i);       } else if (a == 16) {         Vpq[3].push(i);       } else if (a == 23) {         Vpq[4].push(i);       } else if (a == 42) {         Vpq[5].push(i);       }     }     bool flag = 1;     while (flag) {       int indAnterior = -2;       for (int i = 0; i < 6; i++) {         indAnterior = procura(indAnterior, i);         if (indAnterior == -1) {           excluidos += i;           flag = 0;           break;         }       }     }     for (int i = 0; i < 6; i++) {       excluidos += Vpq[i].size();     }     cout << excluidos << endl;     return 0;   }   