826. 安排工作以达到最大收益

安排工作以达到最大收益

• 难度: medium
• 原始链接: https://leetcode.cn/problems/most-profit-assigning-work
• 标签: 排序

解法一: 排序

go

func maxProfitAssignment(difficulty []int, profit []int, worker []int) int {
  type work struct {
    d int
    p int
  }
  n := len(difficulty)
  arr := make([]work, n)
  for i := 0; i < n; i++ {
    arr[i] = work{
      d: difficulty[i],
      p: profit[i],
    }
  }
  sort.Slice(arr, func(i, j int) bool {
    return arr[i].d <= arr[j].d
  })
  sort.Ints(worker)
  ans := 0
  i := 0
  maxVal := 0
  for _, w := range worker {
    for i < n && w >= arr[i].d {
      maxVal = max(maxVal, arr[i].p)
      i++
    }
    ans += maxVal
  }
  return ans
}