Airport

input/code.cpp: In function 'int main()':
input/code.cpp:94:19: error: expected ';' before 'd'
   94 |   Dinic(300, 1, n) d;
      |                   ^~
      |                   ;
input/code.cpp:97:5: error: 'd' was not declared in this scope
   97 |     d.add_edge(i, i + 101, (r[i] == -1 ? 1000000000000000 : r[i]));
      |     ^
input/code.cpp:102:5: error: 'd' was not declared in this scope
  102 |     d.add_edge(a + 101, b + 101, 1000000000000000);
      |     ^
input/code.cpp:104:11: error: 'd' was not declared in this scope
  104 |   cout << d.flow() << '\n';
      |           ^

#include <bits/stdc++.h>

using namespace std;

struct FlowEdge {
    int v, u;
    long long cap, flow = 0;
    FlowEdge(int v, int u, long long cap) : v(v), u(u), cap(cap) {}
};

struct Dinic {
    const long long flow_inf = 1e18;
    vector<FlowEdge> edges;
    vector<vector<int>> adj;
    int n, m = 0;
    int s, t;
    vector<int> level, ptr;
    queue<int> q;

    Dinic(int n, int s, int t) : n(n), s(s), t(t) {
        adj.resize(n);
        level.resize(n);
        ptr.resize(n);
    }

    void add_edge(int v, int u, long long cap) {
        edges.emplace_back(v, u, cap);
        edges.emplace_back(u, v, 0);
        adj[v].push_back(m);
        adj[u].push_back(m + 1);
        m += 2;
    }

    bool bfs() {
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            for (int id : adj[v]) {
                if (edges[id].cap == edges[id].flow)
                    continue;
                if (level[edges[id].u] != -1)
                    continue;
                level[edges[id].u] = level[v] + 1;
                q.push(edges[id].u);
            }
        }
        return level[t] != -1;
    }

    long long dfs(int v, long long pushed) {
        if (pushed == 0)
            return 0;
        if (v == t)
            return pushed;
        for (int& cid = ptr[v]; cid < (int)adj[v].size(); cid++) {
            int id = adj[v][cid];
            int u = edges[id].u;
            if (level[v] + 1 != level[u])
                continue;
            long long tr = dfs(u, min(pushed, edges[id].cap - edges[id].flow));
            if (tr == 0)
                continue;
            edges[id].flow += tr;
            edges[id ^ 1].flow -= tr;
            return tr;
        }
        return 0;
    }

    long long flow() {
        long long f = 0;
        while (true) {
            fill(level.begin(), level.end(), -1);
            level[s] = 0;
            q.push(s);
            if (!bfs())
                break;
            fill(ptr.begin(), ptr.end(), 0);
            while (long long pushed = dfs(s, flow_inf)) {
                f += pushed;
            }
        }
        return f;
    }
};

int n, m;
int r[105];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  Dinic(300, 1, n) d;
  for (int i = 1; i <= n; i++) {
    cin >> r[i];
    d.add_edge(i, i + 101, (r[i] == -1 ? 1000000000000000 : r[i]));
  }
  while (m--) {
    int a, b;
    cin >> a >> b;
    d.add_edge(a + 101, b + 101, 1000000000000000);
  }
  cout << d.flow() << '\n';
  return 0;
}