func_code_string: #include <bits/stdc++.h>   using namespace std;   string lower(string s) {     for (int i = 0; i < s.size(); i++) s[i] = tolower(s[i]);     return s;   }   vector<string> sep(string s, char c) {     string temp;     vector<string> res;     for (int i = 0; i < s.size(); i++) {       if (s[i] == c) {         if (temp !=   ) res.push_back(temp);         temp =   ;         continue;       }       temp = temp + s[i];     }     if (temp !=   ) res.push_back(temp);     return res;   }   template <class T>   T toint(string s) {     stringstream ss(s);     T ret;     ss >> ret;     return ret;   }   template <class T>   string tostr(T inp) {     string ret;     stringstream ss;     ss << inp;     ss >> ret;     return ret;   }   template <class T>   void D(T A[], int n) {     for (int i = 0; i < n; i++) cout << A[i] <<    ;     cout << endl;   }   template <class T>   void D(vector<T> A, int n = -1) {     if (n == -1) n = A.size();     for (int i = 0; i < n; i++) cout << A[i] <<    ;     cout << endl;   }   vector<int> edge[1001];   vector<int> cost[1001];   int main() {     int n;     scanf( %d , &n);     vector<pair<int, int> > lst;     for (int(i) = (0); (i) < (n); (i)++) {       int pq;       scanf( %d , &pq);       lst.push_back((make_pair(pq, i)));     }     sort(lst.rbegin(), lst.rend());     int m;     scanf( %d , &m);     for (int(i) = (0); (i) < (m); (i)++) {       int a, b, c;       scanf( %d%d%d , &a, &b, &c);       a--;       b--;       edge[b].push_back((a));       cost[b].push_back((c));     }     long long ans = 1000000000000LL;     for (int(i) = (0); (i) < (n); (i)++) {       long long total = 0;       bool tval = 1;       for (int(j) = (0); (j) < (n); (j)++) {         if (i == j) continue;         if (edge[j].size() == 0) {           tval = 0;           break;         }         long long chs = 1000000000000LL;         for (int(k) = (0); (k) < (edge[j].size()); (k)++)           chs = min(chs, (long long)cost[j][k]);         total += chs;       }       if (!tval) continue;       ans = min(ans, total);     }     if (ans == 1000000000000LL)       cout << -1 << endl;     else       cout << ans << endl;   }   