Submission #74555194

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);
}
int N;
int W[312345], P[312345];
int delta[312345];
int main(void) {
  int T, tc;
  if (scanf("%d", &T) != 1) return 1;
  for (tc = 0; tc < T; tc++) {
    int i;
    long long score = 0;
    if (scanf("%d", &N) != 1) return 1;
    for (i = 0; i < N; i++) {
      if (scanf("%d%d", &W[i], &P[i]) != 2) return 1;
      score -= W[i];
      delta[i] = W[i] + P[i];
    }
    qsort(delta, N, sizeof(*delta), cmp);
    for (i = 0; i < N; i++) {
      score += delta[i];
      if (score >= 0) break;
    }
    printf("%d\n", N - (i + 1));
  }
  return 0;
}
/*
評価値 = 「ソリを引く」トナカイのPの和 - 「ソリに乗る」トナカイのWの和
これが0以上であればおｋ
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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);
}

int N;
int W[312345], P[312345];

int delta[312345];

int main(void) {
	int T, tc;
	if (scanf("%d", &T) != 1) return 1;
	for (tc = 0; tc < T; tc++) {
		int i;
		long long score = 0;
		if (scanf("%d", &N) != 1) return 1;
		for (i = 0; i < N; i++) {
			if (scanf("%d%d", &W[i], &P[i]) != 2) return 1;
			score -= W[i];
			delta[i] = W[i] + P[i];
		}
		qsort(delta, N, sizeof(*delta), cmp);
		for (i = 0; i < N; i++) {
			score += delta[i];
			if (score >= 0) break;
		}
		printf("%d\n", N - (i + 1));
	}
	return 0;
}

/*

評価値 = 「ソリを引く」トナカイのPの和 - 「ソリに乗る」トナカイのWの和

これが0以上であればおｋ

まず、全員「ソリに乗る」 → 評価値 = -(Wの和)

1人「ソリを引く」に回す → 評価値 += P + W

なので、P + W の大きい順に「ソリを引く」に回していけばよい

*/

Submission Info

Judge Result