#351676 (Java21) No.838 Noelちゃんと星々3

• 問題: No.838 Noelちゃんと星々3
• ユーザー: uwi
• 提出日時: 2019-06-14 21:32:24
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 209 ms / 2,000 ms
• コード長: 3,331 bytes
• コンパイル時間: 4,471 ms
• コンパイル使用メモリ: 80,560 KB
• 実行使用メモリ: 41,604 KB
• 最終ジャッジ日時: 2024-11-09 00:26:40
• 合計ジャッジ時間: 8,457 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	208 ms; 40,904 KB
testcase_01	AC	203 ms; 41,056 KB
testcase_02	AC	154 ms; 41,260 KB
testcase_03	AC	207 ms; 41,604 KB
testcase_04	AC	209 ms; 41,304 KB
testcase_05	AC	51 ms; 37,020 KB
testcase_06	AC	52 ms; 36,792 KB
testcase_07	AC	52 ms; 37,264 KB
testcase_08	AC	51 ms; 36,796 KB
testcase_09	AC	53 ms; 37,156 KB
testcase_10	AC	52 ms; 36,808 KB
testcase_11	AC	53 ms; 37,288 KB
testcase_12	AC	53 ms; 36,932 KB
testcase_13	AC	53 ms; 37,060 KB
testcase_14	AC	53 ms; 37,028 KB
testcase_15	AC	53 ms; 37,132 KB
testcase_16	AC	52 ms; 37,100 KB
testcase_17	AC	52 ms; 37,168 KB
testcase_18	AC	53 ms; 36,764 KB
testcase_19	AC	52 ms; 36,808 KB
testcase_20	AC	52 ms; 36,928 KB
testcase_21	AC	52 ms; 37,156 KB
testcase_22	AC	52 ms; 37,088 KB
testcase_23	AC	52 ms; 37,144 KB
testcase_24	AC	52 ms; 37,244 KB
testcase_25	AC	52 ms; 37,140 KB
testcase_26	AC	51 ms; 37,056 KB
testcase_27	AC	53 ms; 36,648 KB
testcase_28	AC	51 ms; 37,148 KB

ソースコード

package contest190614;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	int[] a;
	
	void solve()
	{
		int n = ni();
		a = na(n);
		Arrays.sort(a);
		long[] dp = new long[n+1];
		Arrays.fill(dp, Long.MAX_VALUE / 2);
		dp[0] = 0;
		for(int i = 2;i <= n;i++){
			dp[i] = Math.min(dp[i], dp[i-2] + a[i-1] - a[i-2]); 
			if(i > 2)dp[i] = Math.min(dp[i], dp[i-3] + a[i-1] - a[i-3]); 
		}
		out.println(dp[n]);
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new D().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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))){ // when nextLine, (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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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)); }
}