type
status
date
slug
summary
tags
category
icon
password

题目

https://leetcode.com/problems/total-cost-to-hire-k-workers/description/
You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker.
You are also given two integers k and candidates. We want to hire exactly k workers according to the following rules:
  • You will run k sessions and hire exactly one worker in each session.
  • In each hiring session, choose the worker with the lowest cost from either the first candidates workers or the last candidates workers. Break the tie by the smallest index.
    • For example, if costs = [3,2,7,7,1,2] and candidates = 2, then in the first hiring session, we will choose the 4th worker because they have the lowest cost [3,2,7,7,1,2].
    • In the second hiring session, we will choose 1st worker because they have the same lowest cost as 4th worker but they have the smallest index [3,2,7,7,2]. Please note that the indexing may be changed in the process.
  • If there are fewer than candidates workers remaining, choose the worker with the lowest cost among them. Break the tie by the smallest index.
  • A worker can only be chosen once.
Return the total cost to hire exactly k workers.

解题思路

两个小顶堆
C版本
Rust 版本
奇丑无比的 Rust 代码…，Rust还是写的太少了呀(´･_･`)
相关文章
加锁文章2 - 密码123456
专题讲解——贪心
专题讲解——动态规划
图——搜索算法及其应用(二)
图——基础(一)
Leetcode 65. Valid Number
Leetcode 4. Median of Two Sorted ArraysLeetcode 139. Word Break