結果
問題 | No.1708 Quality of Contest |
ユーザー | tenten |
提出日時 | 2023-04-19 08:30:45 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 941 ms / 2,000 ms |
コード長 | 2,631 bytes |
コンパイル時間 | 2,337 ms |
コンパイル使用メモリ | 89,356 KB |
実行使用メモリ | 58,064 KB |
最終ジャッジ日時 | 2024-10-14 08:14:55 |
合計ジャッジ時間 | 19,100 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
37,208 KB |
testcase_01 | AC | 48 ms
37,124 KB |
testcase_02 | AC | 49 ms
36,808 KB |
testcase_03 | AC | 135 ms
40,708 KB |
testcase_04 | AC | 139 ms
40,536 KB |
testcase_05 | AC | 134 ms
41,012 KB |
testcase_06 | AC | 135 ms
40,616 KB |
testcase_07 | AC | 132 ms
40,424 KB |
testcase_08 | AC | 50 ms
37,052 KB |
testcase_09 | AC | 450 ms
57,004 KB |
testcase_10 | AC | 718 ms
57,648 KB |
testcase_11 | AC | 838 ms
57,308 KB |
testcase_12 | AC | 842 ms
58,040 KB |
testcase_13 | AC | 753 ms
57,884 KB |
testcase_14 | AC | 941 ms
57,232 KB |
testcase_15 | AC | 751 ms
58,064 KB |
testcase_16 | AC | 838 ms
57,556 KB |
testcase_17 | AC | 794 ms
57,500 KB |
testcase_18 | AC | 813 ms
57,104 KB |
testcase_19 | AC | 771 ms
56,820 KB |
testcase_20 | AC | 749 ms
57,428 KB |
testcase_21 | AC | 854 ms
57,524 KB |
testcase_22 | AC | 811 ms
57,908 KB |
testcase_23 | AC | 784 ms
57,276 KB |
testcase_24 | AC | 748 ms
57,212 KB |
testcase_25 | AC | 756 ms
57,948 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); int add = sc.nextInt(); Question[] questions = new Question[n]; for (int i = 0; i < n; i++) { questions[i] = new Question(sc.nextInt(), sc.nextInt() - 1); } Arrays.sort(questions); boolean[] used = new boolean[m]; for (int i = 0; i < n; i++) { if (!used[questions[i].type]) { questions[i].value += add; used[questions[i].type] = true; } } Arrays.sort(questions); long[] sums = new long[n + 1]; for (int i = 1; i <= n; i++) { sums[i] = sums[i - 1] + questions[i - 1].value; } int k = sc.nextInt(); long ans = 0; while (k-- > 0) { ans += sums[sc.nextInt()]; } System.out.println(ans); } static class Question implements Comparable<Question> { int value; int type; public Question(int value, int type) { this.value = value; this.type = type; } public int compareTo(Question another) { return another.value - value; } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }