Submission #74575639

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <stdio.h>
#include <stdlib.h>
int cmp(const void* x, const void* y) {
  int a = *(const int*)x, b = *(const int*)y;
  return (a > b) - (a < b);
}
#define MOD_BY 998244353
int add(int a, int b) {
  return a + b - MOD_BY * (a + b >= MOD_BY);
}
int sub(int a, int b) {
  return b == 0 ? a : add(a, MOD_BY - b);
}
int mul(int a, int b) {
  return (int)((long long)a * b % MOD_BY);
}
int N, M;
int A[312345];
int B[312345];
int Bsum[312345];
int main(void) {
  int i;
  int ans = 0;
  if (scanf("%d%d", &N, &M) != 2) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
  }
  for (i = 1; i <= M; i++) {
    if (scanf("%d", &B[i]) != 1) return 1;
  }
  qsort(B + 1, M, sizeof(*B), cmp);
  for (i = 1; i <= M; i++) Bsum[i] = add(Bsum[i - 1], B[i]);
  for (i = 0; i < N; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

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

#define MOD_BY 998244353

int add(int a, int b) {
	return a + b - MOD_BY * (a + b >= MOD_BY);
}

int sub(int a, int b) {
	return b == 0 ? a : add(a, MOD_BY - b);
}

int mul(int a, int b) {
	return (int)((long long)a * b % MOD_BY);
}

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

int Bsum[312345];

int main(void) {
	int i;
	int ans = 0;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	for (i = 1; i <= M; i++) {
		if (scanf("%d", &B[i]) != 1) return 1;
	}
	qsort(B + 1, M, sizeof(*B), cmp);
	for (i = 1; i <= M; i++) Bsum[i] = add(Bsum[i - 1], B[i]);
	for (i = 0; i < N; i++) {
		int le = 0, g = M + 1;
		while (le + 1 < g) {
			int m = le + (g - le) / 2;
			if (B[m] <= A[i]) le = m; else g = m;
		}
		ans = add(ans, sub(mul(A[i], le), Bsum[le]));
		ans = add(ans, sub(sub(Bsum[M], Bsum[le]), mul(A[i], M + 1 - g)));
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result