不知道为啥只有91分。

#include <vector>
#include <iostream>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stack>

using namespace std;

struct lift {
   int h;
   int a;
};

bool cmp(const lift& lift1, const lift& lift2) {
   return lift1.a < lift2.a;
}

int main() {
   int n;
   cin >> n;

   vector<int> h(n);
   vector<int> a(n);
   vector<int> c(n);

   for (int i = 0; i < n; ++i) {
      cin >> h[i] >> a[i] >> c[i];
   }

   vector<lift> lifts;
   int hsum = 0;
   for (int i = 0; i < n; ++i) {
      for (int j = 1; j <= c[i]; j <<= 1) {
         lifts.push_back({h[i] * j, a[i]});
         c[i] -= j;
         hsum += h[i] * j;
      }
      if (c[i] != 0) {
         lifts.push_back({h[i] * c[i], a[i]});
         hsum += h[i] * c[i];
      }
   }
   sort(lifts.begin(), lifts.end(), cmp);

   vector<bool> dp(hsum + 1);
   dp[0] = true;
   for (int i = 0; i < lifts.size(); ++i) {
      for (int j = lifts[i].a; j >= lifts[i].h; --j) {
         dp[j] = dp[j] || dp[j - lifts[i].h];
      }
   }
   int ans = 0;
   for (int j = hsum; j >= 0; j--) {
      if (dp[j]) {
         ans = j;
         break;
      }
   }
   cout << ans;
   return 0;
}