結果
| 問題 |
No.1708 Quality of Contest
|
| コンテスト | |
| ユーザー |
watarimaycry2
|
| 提出日時 | 2021-10-15 22:28:41 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,336 ms / 2,000 ms |
| コード長 | 5,220 bytes |
| コンパイル時間 | 2,751 ms |
| コンパイル使用メモリ | 84,812 KB |
| 実行使用メモリ | 131,676 KB |
| 最終ジャッジ日時 | 2024-09-17 17:41:34 |
| 合計ジャッジ時間 | 25,957 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 23 |
ソースコード
import java.util.*; import java.io.*; import java.math.*;
public class Main{
//見なくていいよ ここから------------------------------------------
static class InputIterator{
ArrayList<String> inputLine = new ArrayList<>(buf);
int index = 0; int max; String read;
InputIterator(){
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
try{
while((read = br.readLine()) != null){
inputLine.addAll(Arrays.asList(read.split(" ")));
}
}catch(IOException e){}
max = inputLine.size();
}
boolean hasNext(){return (index < max);}
String next(){
if(hasNext()){
return inputLine.get(index++);
}else{
throw new IndexOutOfBoundsException("There is no more input");
}
}
}
//入力バッファサイズのつもり。入力点数(スペース区切りでの要素数)が100万を超える場合はバッファサイズを100万にすること
static int buf = 1024;
static HashMap<Integer, String> CONVSTR = new HashMap<>();
static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
static PrintWriter out = new PrintWriter(System.out);
static void flush(){out.flush();}
static void myout(Object t){out.println(t);}
static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
static String next(){return ii.next();}
static boolean hasNext(){return ii.hasNext();}
static int nextInt(){return Integer.parseInt(next());}
static long nextLong(){return Long.parseLong(next());}
static double nextDouble(){return Double.parseDouble(next());}
static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
static ArrayList<String> nextStrArray(int size){
ArrayList<String> ret = new ArrayList<>(size);
for(int i = 0; i < size; i++){
ret.add(next());
}
return ret;
}
static ArrayList<Integer> nextIntArray(int size){
ArrayList<Integer> ret = new ArrayList<>(size);
for(int i = 0; i < size; i++){
ret.add(Integer.parseInt(next()));
}
return ret;
}
static ArrayList<Long> nextLongArray(int size){
ArrayList<Long> ret = new ArrayList<>(size);
for(int i = 0; i < size; i++){
ret.add(Long.parseLong(next()));
}
return ret;
}
@SuppressWarnings("unchecked")
static String myconv(Object list, int no){//only join
StringBuilder sb = new StringBuilder("");
String joinString = CONVSTR.get(no);
if(list instanceof String[]){
return String.join(joinString, (String[])list);
}else if(list instanceof long[]){
long[] tmp = (long[])list;
if(tmp.length == 0){
return "";
}
sb.append(String.valueOf(tmp[0]));
for(int i = 1; i < tmp.length; i++){
sb.append(joinString).append(String.valueOf(tmp[i]));
}
return sb.toString();
}else if(list instanceof int[]){
int[] tmp = (int[])list;
if(tmp.length == 0){
return "";
}
sb.append(String.valueOf(tmp[0]));
for(int i = 1; i < tmp.length; i++){
sb.append(joinString).append(String.valueOf(tmp[i]));
}
return sb.toString();
}else if(list instanceof ArrayList){
ArrayList tmp = (ArrayList)list;
if(tmp.size() == 0){
return "";
}
sb.append(tmp.get(0));
for(int i = 1; i < tmp.size(); i++){
sb.append(joinString).append(tmp.get(i));
}
return sb.toString();
}else{
throw new ClassCastException("Don't join");
}
}
static ArrayList<String> myconv(String str, int no){//only split
String splitString = CONVSTR.get(no);
return new ArrayList<String>(Arrays.asList(str.split(splitString)));
}
static ArrayList<String> myconv(String str, String no){
return new ArrayList<String>(Arrays.asList(str.split(no)));
}
public static void main(String[] args){
CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
solve();flush();
}
//見なくていいよ ここまで------------------------------------------
//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
static void solve(){//ここがメイン関数
int N = nextInt();
int M = nextInt();
int X = nextInt();
ArrayList<Integer>[] list = new ArrayList[M + 1];
for(int i = 1; i <= M; i++){
list[i] = new ArrayList<>();
}
for(int i = 0; i < N; i++){
int A = nextInt();
int B = nextInt();
list[B].add(A);
}
PriorityQueue<Q> pq = new PriorityQueue<>();
for(int i = 1; i <= M; i++){
if(list[i].size() == 0){
continue;
}
Collections.sort(list[i], Comparator.reverseOrder());
int V = list[i].get(0);
list[i].set(0, V + X);
for(int A : list[i]){
pq.add(new Q(A, i));
}
}
long[] sums = new long[N + 1];
int index = 1;
long sum = 0;
while(pq.size() > 0){
Q now = pq.poll();
int nowA = now.A;
sum += nowA;
sums[index] = sum;
index++;
}
int K = nextInt();
long output = 0;
for(int i = 0; i < K; i++){
int C = nextInt();
output += sums[C];
}
myout(output);
}
//メソッド追加エリア ここから
static class Q implements Comparable<Q>{
int A;
int B;
Q(int A, int B){
this.A = A;
this.B = B;
}
public int compareTo(Q ato){
return ato.A - this.A;
}
public String toString(){
return "A : " + A + ", B : " + B;
}
}
//メソッド追加エリア ここまで
}
watarimaycry2