Language: Java

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Shivam
 */
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);
        DKnapsack1 solver = new DKnapsack1();
        solver.solve(1, in, out);
        out.close();
    }

    static class DKnapsack1 {
        long dp;

        public long knapsack(int w[], int v[], int n, int c) {
            if (w[n] > c)
                dp[n][c] = knapsack(w, v, n - 1, c);
            else if (n == 0 || c == 0)
                dp[n][c] = 0;
            else
                dp[n][c] = Math.max(knapsack(w, v, n - 1, c - w[n]) + v[n], knapsack(w, v, n - 1, c));
            return dp[n][c];
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int c = in.nextInt();
            dp = new long[n + 1][c + 1];
            int w[] = new int[n + 1];
            int v[] = new int[n + 1];
            for (int i = 1; i <= n; i++) {
                w[i] = in.nextInt();
                v[i] = in.nextInt();
            }
            long answer = knapsack(w, v, n, c);
            out.println(answer);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[8192];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

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

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

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}



Compiler output:
Main.java:31: error: array required, but long found
                dp[n][c] = knapsack(w, v, n - 1, c);
                  ^
Main.java:33: error: array required, but long found
                dp[n][c] = 0;
                  ^
Main.java:35: error: array required, but long found
                dp[n][c] = Math.max(knapsack(w, v, n - 1, c - w[n]) + v[n], knapsack(w, v, n - 1, c));
                  ^
Main.java:36: error: array required, but long found
            return dp[n][c];
                     ^
Main.java:42: error: incompatible types: long[][] cannot be converted to long
            dp = new long[n + 1][c + 1];
                 ^
5 errors