結果
問題 | No.710 チーム戦 |
ユーザー | tenten |
提出日時 | 2023-12-19 16:35:22 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 300 ms / 3,000 ms |
コード長 | 2,344 bytes |
コンパイル時間 | 2,726 ms |
コンパイル使用メモリ | 84,364 KB |
実行使用メモリ | 90,048 KB |
最終ジャッジ日時 | 2024-09-27 08:54:40 |
合計ジャッジ時間 | 8,781 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 25 |
ソースコード
import java.io.*;import java.util.*;import java.util.stream.*;public class Main {static int[][] dp;static int[] a;static int[] b;public static void main(String[] args) throws Exception {Scanner sc = new Scanner();int n = sc.nextInt();int total = 0;a = new int[n];b = new int[n];for (int i = 0; i < n; i++) {a[i] = sc.nextInt();b[i] = sc.nextInt();total += a[i];}dp = new int[n][total + 1];for (int[] arr : dp) {Arrays.fill(arr, -1);}int ans = Integer.MAX_VALUE;for (int i = 0; i <= total; i++) {ans = Math.min(ans, Math.max(i, dfw(n - 1, i)));}System.out.println(ans);}static int dfw(int idx, int v) {if (v < 0) {return Integer.MAX_VALUE / 2;}if (idx < 0) {return 0;}if (dp[idx][v] < 0) {dp[idx][v] = Math.min(dfw(idx - 1, v) + b[idx], dfw(idx - 1, v - a[idx]));}return dp[idx][v];}}class Utilities {static String arrayToLineString(Object[] arr) {return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));}static String arrayToLineString(int[] arr) {return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));}}class Scanner {BufferedReader br = new BufferedReader(new InputStreamReader(System.in));StringTokenizer st = new StringTokenizer("");StringBuilder sb = new StringBuilder();public Scanner() throws Exception {}public int nextInt() throws Exception {return Integer.parseInt(next());}public long nextLong() throws Exception {return Long.parseLong(next());}public double nextDouble() throws Exception {return Double.parseDouble(next());}public int[] nextIntArray() throws Exception {return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();}public String next() throws Exception {while (!st.hasMoreTokens()) {st = new StringTokenizer(br.readLine());}return st.nextToken();}}