Add status for MCMF

Signed-off-by: Bruno Freitas Tissei <bft15@inf.ufpr.br>

algorithms/graph/min_cost_max_flow.cpp

@@ -2,17 +2,18 @@
 ///
 /// Time: O(V^2 * E)
 /// Space: O(V + E)
+///
+/// Status: Tested (UVA10594,kattis/mincostmaxflow)
   
 struct MinCostMaxFlow {
   struct Edge { int u, v, cap, cost; };
 
-  int N;
   vector<Edge> edges;
   vector<vector<int>> adj;
   vector<int> vis, dist, par, ind;
 
   MinCostMaxFlow(int N) :
-    N(N), vis(N), dist(N), par(N), ind(N), adj(N) {}
+    vis(N), dist(N), par(N), ind(N), adj(N) {}
 
   void add_edge(int u, int v, int cap, int cost) {
     adj[u].pb(edges.size());