結果

問題 No.1708 Quality of Contest
ユーザー cyclerecycle9cyclerecycle9
提出日時 2021-12-06 16:51:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 731 ms / 2,000 ms
コード長 4,460 bytes
コンパイル時間 2,734 ms
コンパイル使用メモリ 80,100 KB
実行使用メモリ 86,888 KB
最終ジャッジ日時 2023-09-21 15:36:43
合計ジャッジ時間 18,331 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,660 KB
testcase_01 AC 45 ms
49,912 KB
testcase_02 AC 46 ms
49,800 KB
testcase_03 AC 93 ms
52,504 KB
testcase_04 AC 97 ms
52,856 KB
testcase_05 AC 94 ms
52,656 KB
testcase_06 AC 93 ms
52,760 KB
testcase_07 AC 95 ms
52,656 KB
testcase_08 AC 45 ms
49,792 KB
testcase_09 AC 481 ms
86,888 KB
testcase_10 AC 731 ms
76,540 KB
testcase_11 AC 665 ms
78,544 KB
testcase_12 AC 602 ms
78,000 KB
testcase_13 AC 655 ms
74,184 KB
testcase_14 AC 660 ms
80,408 KB
testcase_15 AC 639 ms
84,860 KB
testcase_16 AC 617 ms
79,988 KB
testcase_17 AC 613 ms
79,288 KB
testcase_18 AC 658 ms
80,564 KB
testcase_19 AC 620 ms
81,220 KB
testcase_20 AC 595 ms
78,916 KB
testcase_21 AC 590 ms
80,064 KB
testcase_22 AC 615 ms
79,840 KB
testcase_23 AC 637 ms
81,768 KB
testcase_24 AC 631 ms
69,276 KB
testcase_25 AC 699 ms
71,576 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.*;
import java.util.concurrent.locks.ReentrantReadWriteLock.WriteLock;
import java.io.File;
import java.io.FileDescriptor;
import java.io.FileOutputStream;
import java.io.OutputStream;
import java.io.UncheckedIOException;
import java.lang.Thread.State;
import java.lang.reflect.Field;
import java.nio.CharBuffer;
import java.nio.charset.CharacterCodingException;
import java.nio.charset.CharsetEncoder;
import java.nio.charset.StandardCharsets;

public class Main {
	static final long MOD1=1000000007;
	static final long MOD=998244353;
	static long ans=0;
	public static void main(String[] args){
		PrintWriter out = new PrintWriter(System.out);
		InputReader sc=new InputReader(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		long X = sc.nextLong();
		ArrayList<Long>[] lists = new ArrayList[M];
		for (int i = 0; i < lists.length; i++) {
			lists[i] = new ArrayList<>();
		}
		PriorityQueue<Long> pq = new PriorityQueue<>(Comparator.reverseOrder());
		for (int i = 0; i < N; i++) {
			long a = sc.nextLong();
			int b = sc.nextInt()-1;
			lists[b].add(a);
		}
		for (int i = 0; i < lists.length; i++) {
			if(lists[i].size()==0)continue;
			Collections.sort(lists[i],Comparator.reverseOrder());
			pq.add(lists[i].get(0)+X);
			for (int j = 1; j < lists[i].size(); j++) {
				long a_ = lists[i].get(j);
				pq.add(a_);
			}
		}
		int K = sc.nextInt();
		int[] C = sc.nextIntArray(K);
		long[] sum = new long[N+1];
		for (int i = 1; i < sum.length; i++) {
			sum[i] = pq.poll() + sum[i-1];
		}
		long ans = 0;
		for (int i = 0; i < K; i++) {
			ans += sum[C[i]];
		}
		System.out.println(ans);
   	}
	static class InputReader { 
		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;
		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}
		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}
 
		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}
 
		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}
 
		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}
 
		public boolean hasNext() {
			skip();
			return hasNextByte();
		}
 
		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
 
		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public double nextDouble() {
			return Double.parseDouble(next());
		}
 
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
		public double[] nextDoubleArray(int n) {
			double[] a = new double[n];
			for (int i = 0; i < n; i++)
				a[i] = nextDouble();
			return a;
		}
		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}
 
		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}
0