Skip to main content

Priority_queue Question 1

Leetcode 857 Minimum Cost to Hire K Workers

There are n workers. You are given two integer arrays quality and wage where quality[i] is the quality of the ith worker and wage[i] is the minimum wage expectation for the ith worker.

We want to hire exactly k workers to form a paid group. To hire a group of k workers, we must pay them according to the following rules:

Every worker in the paid group should be paid in the ratio of their quality compared to other workers in the paid group.

Every worker in the paid group must be paid at least their minimum-wage expectation.

Given the integer k, return the least amount of money needed to form a paid group satisfying the above conditions. Answers within 10-5 of the actual answer will be accepted.

Constraints:

n == quality.length == wage.length

1 <= k <= n <= 10^4

1 <= quality[i], wage[i] <= 10^4


Analysis:

The first step is to get the wage/quality ratio. 

Let focus on a small size first: we have two people only, (q1, r1) and (q2, r2), where q is quality and r is the wage/quality ratio. If r1 > r2, and we choose to pay the first worker with his minimum wage expectation, so the ratio is r1; then we need to pay the second worker with q2*r1. So the wage/quality ratio for the second worker is the same as that for the first worker. Since r1 is higher than r2, the plan is valid for both workers.

If we choose to pay the second worker with his minimum wage expectation, then we need to pay the first worker with q1*r2, which is not a valid plan since r2 < r1, because the minimum payment requires to pay the first worker with the ratio of r1. If we adjust the payment ratio for the first worker to be r1, then this payment plan is the same as that in the first plan of payment.

After running the test case with a very small size, we can make the following conclusions:

1. for a group of people, we can always use the one with the highest ratio as the base. Then all the rest people having a smaller ratio can be payed with the same ratio, and the payment plan is always valid;

2. after determining the base and the ratio, then we need to use the ones with the smallest qualities. Why? because the payment is ratio*quality.

So now it is relative clear: we need to sort the workers by their wage/quality ratios. Then, once a worker is chosen as the base, then all the workers before him (having smaller ratios) can be picked up in the team with the same payment ratio as the base (the reason is in 1 above). Then we need to pick up the workers with top-k smallest qualities (the reason is in 2 above), which will give the lowest cost for k workers with the first worker picked as the payment base.

Now let think about how to code. The first step can be implemented by sorting; for the second step, we need to pick up the workers with the top-k smallest qualities, so priority_queue becomes one of the choices.


See the code below:

class Solution {
public:
    double mincostToHireWorkers(vector<int>& quality, vector<int>& wage, int k) {
        double res = INT_MAX;
        int n = quality.size();
        vector<pair<int, double>> data;
        for(int i=0; i<n; ++i) {
            data.push_back({quality[i], wage[i]*1.0/quality[i]});
        }
        sort(data.begin(), data.end(), [](auto &a, auto &b){    
            return a.second < b.second;
        });
        int sum = 0;
        priority_queue<int> pq;
        for(int i=0; i<n; ++i) {
            int t = data[i].first;
            double d = data[i].second;
            sum += t;
            pq.push(t);
            if(pq.size() >= k) {
                if(pq.size() > k) {
                    sum -= pq.top();
                    pq.pop();
                }
                double one = d*sum;
                res = min(res, one);
            }
        }
        return res;
    }
};


 

Upper Layer

Comments

Popular posts from this blog

Brute Force - Question 2

2105. Watering Plants II Alice and Bob want to water n plants in their garden. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially full. They water the plants in the following way: Alice waters the plants in order from left to right, starting from the 0th plant. Bob waters the plants in order from right to left, starting from the (n - 1)th plant. They begin watering the plants simultaneously. It takes the same amount of time to water each plant regardless of how much water it needs. Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise, they first refill their can (instantaneously) then water the plant. In case both Alice and Bob reach the same plant, the one with more water currently in his/her watering can should water this plant. If they have the same amount of water, then Alice ...

Sweep Line

Sweep (or scanning) line algorithm is very efficient for some specific questions involving discrete intervals. The intervals could be the lasting time of events, or the width of a building or an abstract square, etc. In the scanning line algorithm, we usually need to distinguish the start and the end of an interval. After the labeling of the starts and ends, we can sort them together based on the values of the starts and ends. Thus, if there are N intervals in total, we will have 2*N data points (since each interval will contribute 2). The sorting becomes the most time-consuming step, which is O(2N*log(2N) ~ O(N*logN). After the sorting, we usually can run a linear sweep for all the data points. If the data point is labeled as a starting point, it means a new interval is in the processing; when an ending time is reached, it means one of the interval has ended. In such direct way, we can easily figure out how many intervals are in the processes. Other related information can also be obt...

Dynamic Programming - Easy Level - Question 1

Dynamic Programming - Easy Level - Question 1 Leetcode 1646  Get Maximum in Generated Array You are given an integer n. An array nums of length n + 1 is generated in the following way: nums[0] = 0 nums[1] = 1 nums[2 * i] = nums[i] when 2 <= 2 * i <= n nums[2 * i + 1] = nums[i] + nums[i + 1] when 2 <= 2 * i + 1 <= n Return the maximum integer in the array nums​​​. Constraints: 0 <= n <= 100 Analysis: This question is quick straightforward: the state and transitional formula are given; the initialization is also given. So we can just ready the code to iterate all the states and find the maximum. See the code below: class Solution { public: int getMaximumGenerated(int n) { int res = 0; if(n<2) return n; vector<int> f(n+1, 0); f[1] = 1; for(int i=2; i<=n; ++i) { if(i&1) f[i] = f[i/2] + f[i/2+1]; else f[i] = f[i/2]; // cout<<i<<" "<<f[i]<<endl; ...