func_code_string: #include <bits/stdc++.h>   using namespace std;   int main() {     ios::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     int k1, k2, k3;     cin >> k1 >> k2 >> k3;     int n = k1 + k2 + k3;     int maps[n];     for (int i = 0; i < n; i++) {       int inp;       cin >> inp;       inp--;       if (i < k1)         maps[inp] = 0;       else if (i < k1 + k2)         maps[inp] = 1;       else         maps[inp] = 2;     }     int costsk1[n];     int costsk2[n];     int costsk3[n];     int profits[n];     int maxprofits[n];     for (int i = 0; i < n; i++) {       costsk1[i] = (i == 0 ? 0 : costsk1[i - 1]) + (maps[i] == 0 ? 0 : 1);       costsk2[i] = (i == 0 ? 0 : costsk2[i - 1]) + (maps[i] == 1 ? 0 : 1);       costsk3[i] = (i == 0 ? 0 : costsk3[i - 1]) + (maps[i] == 2 ? 0 : 1);       profits[i] = costsk2[i] - costsk1[i];       maxprofits[i] = max((i == 0 ? 0 : maxprofits[i - 1]), profits[i]);     }     int minn = costsk3[n - 1];     for (int i = 0; i < n; i++) {       minn = min(minn, costsk2[i] - maxprofits[i] + costsk3[n - 1] - costsk3[i]);     }     cout << minn << endl;   }   