結果
問題 | No.1251 絶対に間違ってはいけない最小化問題 |
ユーザー |
![]() |
提出日時 | 2020-10-09 22:13:47 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 830 ms / 2,000 ms |
コード長 | 3,346 bytes |
コンパイル時間 | 4,727 ms |
コンパイル使用メモリ | 90,700 KB |
実行使用メモリ | 75,552 KB |
最終ジャッジ日時 | 2024-07-20 12:07:39 |
合計ジャッジ時間 | 33,266 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); long[][] p = new long[n][2]; long bsum = 0; for (int i = 0; i < n; i++) { p[i][0] = nl(); } for (int i = 0; i < n; i++) { p[i][1] = nl(); bsum += p[i][1]; } if (n == 1) { System.out.println(p[0][0] + " " + f(p, p[0][0])); return; } Arrays.sort(p, (o1, o2) -> Long.compare(o1[0], o2[0])); long s = 0; int arg = 0; for (int i = 0; i < n; i++) { s += p[i][1]; if (s * 2 >= bsum) { arg = i; break; } } if (arg > 0 && f(p, p[arg][0]) > f(p, p[arg - 1][0])) { System.out.println(p[arg - 1][0] + " " + f(p, p[arg - 1][0])); } else { System.out.println(p[arg][0] + " " + f(p, p[arg][0])); } } private static long f(long[][] p, long x) { long ret = 0; for (long[] v : p) { ret += v[1] * Math.abs(x - v[0]); } return ret; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }