Language: Java

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collection;
import java.io.IOException;
import java.util.Queue;
import java.util.ArrayDeque;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int x = in.nextInt();
            int y = in.nextInt();
            int z = in.nextInt();
            int n = x + y + z;
            MinCostMaxFlowNetwork g = new MinCostMaxFlowNetwork(n + 3 + 2);
            int source = n + 3;
            int sink = n + 4;
            int[] a = new int[n];
            int[] b = new int[n];
            int[] c = new int[n];
            for (int i = 0; i < n; ++i) {
                a[i] = in.nextInt();
                b[i] = in.nextInt();
                c[i] = in.nextInt();
                g.addEdge(i, sink, 1, 0);
                g.addEdge(n + 0, i, 1, -a[i]);
                g.addEdge(n + 1, i, 1, -b[i]);
                g.addEdge(n + 2, i, 1, -c[i]);
            }
            g.addEdge(source, n + 0, x, 0);
            g.addEdge(source, n + 1, y, 0);
            g.addEdge(source, n + 2, z, 0);
            long ans = g.flow(source, sink)[1];
            out.println(-ans);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }

    static class MinCostMaxFlowNetwork {
        private static final int initialEdgeCapacity = 3;
        public static long Inf = 1L << 62;
        private long[] _capacity;
        private long[] _flow;
        private long[] _cost;
        private int[] _from;


Compiler output:
Main.java:112: error: reached end of file while parsing
        private int[] _from;
                            ^
1 error