leetcode

Solution to some Leetcode problems written in C++

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

0826.cpp (652B)

0 class Solution { 1 public: 2 int maxProfitAssignment(const vector<int> &difficulty, const vector<int> &profit, 3 const vector<int> &worker) const { 4 static int profits[100001]; 5 const int n = size(profit); 6 int res = 0; 7 8 memset(profits, 0x00, sizeof(profits)); 9 for (int i = 0; i < n; i++) { 10 profits[difficulty[i]] = max(profits[difficulty[i]], profit[i]); 11 } 12 13 for (int i = 1; i < 100001; i++) { 14 profits[i] = max(profits[i], profits[i - 1]); 15 } 16 17 for (const int m : worker) 18 res += profits[m]; 19 20 return res; 21 } 22 };