結果

問題 No.615 集合に分けよう
ユーザー yuya178yuya178
提出日時 2017-12-15 00:24:28
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,700 bytes
コンパイル時間 2,549 ms
コンパイル使用メモリ 87,428 KB
実行使用メモリ 48,380 KB
最終ジャッジ日時 2024-05-08 10:33:29
合計ジャッジ時間 7,028 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,336 KB
testcase_01 AC 52 ms
37,092 KB
testcase_02 AC 52 ms
36,808 KB
testcase_03 AC 52 ms
37,368 KB
testcase_04 AC 52 ms
37,108 KB
testcase_05 AC 52 ms
37,252 KB
testcase_06 AC 53 ms
37,144 KB
testcase_07 WA -
testcase_08 AC 54 ms
37,368 KB
testcase_09 AC 52 ms
37,292 KB
testcase_10 AC 53 ms
36,928 KB
testcase_11 AC 52 ms
37,008 KB
testcase_12 AC 54 ms
37,008 KB
testcase_13 AC 55 ms
37,352 KB
testcase_14 AC 57 ms
37,024 KB
testcase_15 WA -
testcase_16 AC 215 ms
43,752 KB
testcase_17 WA -
testcase_18 AC 215 ms
43,780 KB
testcase_19 AC 232 ms
42,964 KB
testcase_20 AC 236 ms
44,204 KB
testcase_21 AC 272 ms
44,668 KB
testcase_22 AC 309 ms
48,380 KB
testcase_23 AC 117 ms
42,040 KB
testcase_24 AC 213 ms
43,420 KB
testcase_25 AC 52 ms
37,140 KB
testcase_26 AC 52 ms
36,916 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 125 ms
41,356 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long MOD = 1_000_000_007;
    int inf = Integer.MAX_VALUE;

    void solve(){
        int n = ni();
        int k = ni();
        long[] a = new long[n];
        for(int i = 0; i < n; i++){
            a[i] = nl();
        }
        Arrays.sort(a);
        long[][] b = new long[n-1][2];
        for(int i = 0; i < n-1; i++){
            b[i][1] = a[i+1]-a[i];
            b[i][0] = i;
        }
        Arrays.sort(b, new Comparator<long[]>() {
            public int compare(long[] a, long[] b) {
                return Long.compare(a[1],b[1]);
            }
        });
        long ans = 0;
        if(n==k){
            out.println(0);
            return;
        }
        if(k==1){
            for(int i = 0; i < n; i++){
                ans += a[i];
            }
            out.println(ans);
            return;
        }
        PriorityQueue<Integer> pq = new PriorityQueue<Integer>();
        for(int i = 0; i < k-1; i++){
            pq.add((int)b[n-2-i][0]);
            // out.println(b[n-2-i][0]);
        }
        long prev = -1;
        int y = pq.poll();
        for(int i = 0; i < n; i++){
            if(prev==-1) prev = a[i];
            if(i==y){
                ans += a[i] - prev;
                // out.println(a[i]-prev);
                prev = -1;
                if(!pq.isEmpty()) y = pq.poll();
                else y = n;
            }
        }
        if(prev!=-1) ans += a[n-1]-prev;
        out.println(ans);
        

    }

    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}
0