Submission #68729928

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, Q;
int A[312345];
int B[312345];
int64_t sum[312345];
int main(void) {
  int i;
  if (scanf("%d%d", &N, &Q) != 2) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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, Q;
int A[312345];
int B[312345];

int64_t sum[312345];

int main(void) {
	int i;
	if (scanf("%d%d", &N, &Q) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	for (i = 0; i < Q; i++) {
		if (scanf("%d", &B[i]) != 1) return 1;
	}

	qsort(A, N, sizeof(*A), cmp);
	sum[0] = A[0];
	for (i = 1; i < N; i++) {
		sum[i] = sum[i - 1] + A[i];
	}

	for (i = 0; i < Q; i++) {
		if(A[N - 1] < B[i]) {
			puts("-1");
		} else {
			int l = -1, ge = N;
			int64_t meow;
			while (l + 1 < ge) {
				int m = l + (ge - l) / 2;
				if (A[m] < B[i]) l = m; else ge = m;
			}
			meow = 0;
			if (l >= 0) meow += sum[l];
			meow += (int64_t)(B[i] - 1) * (N - ge);
			printf("%" PRId64 "\n", meow + 1);
		}
	}

	return 0;
}

/*

どの種類も b-1 個以下しかなければ、敗北する
b 個以上ある種類があれば、勝利できる

b-1 個以下しかない種類 → 全部選ぶ
b 個以上ある種類 → b-1 個選ぶ
これで全部足してx 以下 → b 個以上ある種類を作らずにすむ
otherwise → もう1個以上足さなければならず、b 個以上ある種類ができる

*/

Submission Info

Judge Result