結果
問題 | No.615 集合に分けよう |
ユーザー | Grenache |
提出日時 | 2017-12-17 00:21:18 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 183 ms / 2,000 ms |
コード長 | 4,249 bytes |
コンパイル時間 | 3,373 ms |
コンパイル使用メモリ | 75,220 KB |
実行使用メモリ | 54,960 KB |
最終ジャッジ日時 | 2023-08-21 11:44:10 |
合計ジャッジ時間 | 7,949 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,424 KB |
testcase_01 | AC | 43 ms
49,752 KB |
testcase_02 | AC | 42 ms
49,408 KB |
testcase_03 | AC | 43 ms
49,316 KB |
testcase_04 | AC | 43 ms
49,456 KB |
testcase_05 | AC | 43 ms
49,708 KB |
testcase_06 | AC | 43 ms
49,560 KB |
testcase_07 | AC | 44 ms
49,808 KB |
testcase_08 | AC | 44 ms
49,560 KB |
testcase_09 | AC | 44 ms
49,804 KB |
testcase_10 | AC | 43 ms
49,584 KB |
testcase_11 | AC | 45 ms
49,516 KB |
testcase_12 | AC | 46 ms
49,408 KB |
testcase_13 | AC | 53 ms
49,588 KB |
testcase_14 | AC | 61 ms
51,472 KB |
testcase_15 | AC | 106 ms
53,824 KB |
testcase_16 | AC | 175 ms
53,840 KB |
testcase_17 | AC | 179 ms
54,004 KB |
testcase_18 | AC | 180 ms
53,800 KB |
testcase_19 | AC | 177 ms
53,584 KB |
testcase_20 | AC | 174 ms
54,232 KB |
testcase_21 | AC | 183 ms
54,960 KB |
testcase_22 | AC | 176 ms
52,264 KB |
testcase_23 | AC | 125 ms
53,924 KB |
testcase_24 | AC | 168 ms
53,948 KB |
testcase_25 | AC | 43 ms
49,504 KB |
testcase_26 | AC | 43 ms
49,932 KB |
testcase_27 | AC | 95 ms
52,668 KB |
testcase_28 | AC | 96 ms
52,760 KB |
testcase_29 | AC | 132 ms
53,304 KB |
testcase_30 | AC | 142 ms
53,140 KB |
ソースコード
import java.io.*; import java.util.*; public class Main_yukicoder615 { private static Scanner sc; private static Printer pr; private static void solve() { int n = sc.nextInt(); int k = sc.nextInt(); long[] a = new long[n]; for (int i = 0; i < n; i++) { a[i] = sc.nextLong(); } Arrays.sort(a); long[] diff = new long[n - 1]; for (int i = 1; i < n; i++) { diff[i - 1] = a[i] - a[i - 1]; } Arrays.sort(diff); long ans = 0; for (int i = 0; i < n - 1 - (k - 1); i++) { ans += diff[i]; } pr.println(ans); } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }