Submission #68480581

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
int cmp(const void* x, const void* y) {
  int a = *(const int*)x, b = *(const int*)y;
  return a < b ? -1 : a > b;
}
int N, M;
int A[312345];
int B[312345];
int main(void) {
  int T, tc;
  if (scanf("%d", &T) != 1) return 1;
  for (tc = 0; tc < T; tc++) {
    int i, cur;
    uint64_t sum = 0;
    if (scanf("%d%d", &N, &M) != 2) return 1;
    for (i = 0; i < N; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>

int cmp(const void* x, const void* y) {
	int a = *(const int*)x, b = *(const int*)y;
	return a < b ? -1 : a > b;
}

int N, M;
int A[312345];
int B[312345];

int main(void) {
	int T, tc;
	if (scanf("%d", &T) != 1) return 1;
	for (tc = 0; tc < T; tc++) {
		int i, cur;
		uint64_t sum = 0;
		if (scanf("%d%d", &N, &M) != 2) return 1;
		for (i = 0; i < N; i++) {
			if (scanf("%d", &A[i]) != 1) return 1;
			sum += A[i];
		}
		for (i = 0; i < N; i++) {
			if (scanf("%d", &B[i]) != 1) return 1;
			sum += B[i];
		}
		qsort(A, N, sizeof(*A), cmp);
		qsort(B, N, sizeof(*B), cmp);
		for (i = N - 1, cur = 0; i >= 0 && cur < N; i--, cur++) {
			while (cur < N && A[i] + B[cur] < M) cur++;
			if (cur < N) sum -= M; /* A[i] + B[cur] >= M になった */
		}
		printf("%" PRIu64 "\n", sum);
	}
	return 0;
}

/*

この条件で mod M → -0 or -M
最小値 → -M をなるべくいっぱい発動させたい
-M を発動させるためには、A_i + B_i >= M

A_i を降順でソートしておく
→ 最初は制約がゆるく、だんだん難易度が上がっていく
B_i を昇順でソートしておく
→ 制約がゆるいうちにザコを消化
   ある位置で使えなければ、その後でも使えない

「降順でソート」のかわりに、「昇順でソートし、後ろから見る」

*/

Submission Info

Judge Result