Superman Diwali solution

superman.cpp

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
  /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
  int N, H, I;
  cin >> N >> H >> I;
  
  vector<pair<int, int>> people;
  for (int i=0; i<N; ++i) {
    int u, h;
    cin >> u;
    while (u--) {
      cin >> h;
      people. push_back({h,i});
    }
  }
  sort(people.begin(), people.end());
  
  vector<int> best(H+1), bestb(N);
  int cur = H;
  for(int i=people.size()-1; i>=0; --i) {
    auto [h, b] = people [i];
    while (cur > h) {
      best [cur-1] = best [cur];
      --cur;
    }
    bestb[b] += 1;
    if(h+I <= H) bestb[b] = max(bestb[b], best[h+I]+1);
    best[h] = max(best[h], bestb[b]);
    //cerr << b << " " << h << " " << best[h] << " " << bestb[b] << "\n";
  }
  cout << best[cur] << "\n";
  return 0;
}