成都六度网站建设微信小程序开发软件

成都六度网站建设,微信小程序开发软件,写出网站开发的基本流程,六安人论坛百姓杂谈Problem: 826. Most Profit Assigning Work 安排工作以达到最大收益 解题过程 首先按照相同方式排序difficulty和profit#xff0c;首先difficulty和索引放到一起排序#xff0c;然后将profit的数值放到对应的地方#xff0c;就相当按照difficulty排序的方式排序了profit首先difficulty和索引放到一起排序然后将profit的数值放到对应的地方就相当按照difficulty排序的方式排序了profit最后单独排序difficulty对每个worker二分查找上界最大值对上界下面的拿到最大利润累加即可的Codeclass Solution { public: int maxProfitAssignment(vectorint difficulty, vectorint profit, vectorint worker) { vectorpairint, int tr; int n difficulty.size(), m worker.size(); for(int i 0; i n; i) { tr.push_back({difficulty[i], i}); } functionbool(pairint, int, pairint, int) fun [](pairint, int a, pairint, int c) { return a.first c.first; }; sort(tr.begin(), tr.end(), fun); sort(difficulty.begin(), difficulty.end()); vectorint profitCP profit; for(int i 0; i n; i) { profitCP[i] profit[tr[i].second]; } int ind, sum 0; for(int i 0; i m; i) { ind upper_bound(difficulty.begin(), difficulty.end(), worker[i]) - difficulty.begin(); if(ind 0) { sum *max_element(profitCP.begin(), profitCP.begin() ind); } } return sum; } };官方题解的class Solution { public: int maxProfitAssignment(vectorint difficulty, vectorint profit, vectorint worker) { vectorpairint, int tr; int n difficulty.size(), m worker.size(); for(int i 0; i n; i) { tr.push_back({difficulty[i], profit[i]}); } functionbool(pairint, int, pairint, int) fun [](pairint, int a, pairint, int c) { return a.first c.first; }; sort(tr.begin(), tr.end(), fun); sort(worker.begin(), worker.end()); // sort(difficulty.begin(), difficulty.end()); // vectorint profitCP profit; // for(int i 0; i n; i) { // profitCP[i] profit[tr[i].second]; // } int ind, sum 0, best 0; int j 0; for(int i 0; i m; i) { while(j n tr[j].first worker[i]) { best max(best, tr[j].second); j; } sum best; // ind upper_bound(difficulty.begin(), difficulty.end(), worker[i]) - difficulty.begin(); // if(ind 0) { // sum *max_element(profitCP.begin(), profitCP.begin() ind); // } } return sum; } };