leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1626.cpp (596B)

0 class Solution { 1 public: 2 int bestTeamScore(vector<int> &scores, vector<int> &ages) { 3 int n = scores.size(), res = 0; 4 vector<pair<int, int>> v(n); 5 for (int i = 0; i < n; i++) 6 v[i] = {ages[i], scores[i]}; 7 sort(v.begin(), v.end()); 8 9 vector<int> dp(n, 0); 10 for (int i = 0; i < n; i++) { 11 int total = 0; 12 for (int j = 0; j < i; j++) { 13 if (v[j].second <= v[i].second) dp[i] = max(dp[i], dp[j]); 14 } 15 res = max(res, dp[i] += v[i].second); 16 } 17 18 return res; 19 } 20 };