С

#include <cstdio>
#include <vector>
#include <algorithm>

std::vector<std::vector<unsigned int>> sum;
std::vector<std::vector<unsigned int>> exer;


bool comp_sums(std::vector<unsigned int> i, std::vector<unsigned int> j) { return (i[0]<j[0]); }

int main(void) {
  unsigned int n, q;
  scanf("%u", &n);
  scanf("%u", &q);

  sum.resize(n);
  exer.resize(n);

  for (unsigned int i = 0; i < n; i++) {
    sum[i].resize(2);
    sum[i][1] = 0;
    exer[i].resize(6);
  }

  unsigned int id, score, ex;
  char ex_c;
  for (unsigned int i = 0; i < q; i++) {
    scanf("%u", &id);
    id--;
    scanf(" %c", &ex_c);
    ex = ex_c - 'A';
    scanf("%u", &score);

    exer[id][ex] = score;
    sum[id][1]++;
  }

  for (unsigned int i = 0; i < n; i++) {
    for (unsigned int j = 0; j < 6; j++) {
      sum[i][0] += exer[i][j];
    }
  }

  unsigned int my_sum = sum[0][0], deleted = 0;

  std::sort(sum.begin(), sum.end(), comp_sums);
  while (sum.back()[0] > my_sum) {
    deleted += sum.back()[1];
    sum.pop_back();
}

  printf("%u\n", deleted);
  return 0;
}