結果

問題 No.3325 陰陽師
コンテスト
ユーザー tenten
提出日時 2025-11-10 12:51:37
言語 Java
(openjdk 23)
結果
AC  
実行時間 786 ms / 2,000 ms
コード長 3,752 bytes
コンパイル時間 2,752 ms
コンパイル使用メモリ 82,736 KB
実行使用メモリ 64,164 KB
最終ジャッジ日時 2025-11-10 12:52:02
合計ジャッジ時間 21,528 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;
import java.math.*;

public class Main {
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        TreeMap<Integer, Integer> counts = new TreeMap<>();
        while (n-- > 0) {
            int x = sc.nextInt();
            counts.put(x, counts.getOrDefault(x, 0) + 1);
        }
        int[] values = new int[m];
        int[] targets = new int[m];
        for (int i = 0; i < m; i++) {
            int x = sc.nextInt();
            if (counts.lastKey() < x) {
                break;
            }
            int y = counts.ceilingKey(x);
            values[i] = x;
            targets[i] = y;
            if (counts.get(y) == 1) {
                counts.remove(y);
            } else {
                counts.put(y, counts.get(y) - 1);
            }
        }
        Arrays.sort(values);
        Arrays.sort(targets);
        long ans = 0;
        for (int i = 0; i < m; i++) {
            ans = Math.max(ans, targets[i] - values[i]);
        }
        System.out.println(ans);
    }
}

class FastScanner {
    private DataInputStream din;
    private byte[] buffer;
    private int bufferPointer, bytesRead;
    private static final int BUFFER_SIZE = 1 << 16; // 65,536 バイト

    public FastScanner() {
        din = new DataInputStream(System.in);
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    private byte read() {
        try {
            if (bufferPointer == bytesRead) {
                bytesRead = din.read(buffer, 0, BUFFER_SIZE);
                if (bytesRead == -1) return -1;
                bufferPointer = 0;
            }
            return buffer[bufferPointer++];
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }

    public String next() {
        byte b = read();
        // 空白文字を読み飛ばす
        while (isSpaceChar(b)) {
            b = read();
        }
        StringBuilder sb = new StringBuilder();
        while (!isSpaceChar(b)) {
            sb.append((char) b);
            b = read();
        }
        return sb.toString();
    }

    public int nextInt() {
        int ret = 0;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return neg ? -ret : ret;
    }

    public long nextLong() {
        long ret = 0;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10L + c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return neg ? -ret : ret;
    }

    public double nextDouble() {
        double ret = 0, div = 1;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (!isSpaceChar(c) && c != '.');
        if (c == '.') {
            while (!isSpaceChar(c = read())) {
                ret += (c - '0') / (div *= 10);
            }
        }
        return neg ? -ret : ret;
    }

    private boolean isSpaceChar(byte c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public void close() {
        try {
            if (din != null) din.close();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }
}
0