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

Post a Comment

Popular posts from this blog

Segment Tree

Segment tree can be viewed as an abstract data structure which using some more space to trade for speed. For example, for a typical question with O(N^2) time complexity, the segment tree method can decrease it to O(N*log(N)).  To make it understandable, let us consider one example. Say we have an integer array of N size, and what we want is to query the maximum with a query range [idx1, idx2], where idx1 is the left indexes, and idx2 is the right indexes inclusive. If we only do this kind of query once, then we just need to scan through the array from idx1 to idx2 once, and record the maximum, done. The time complexity is O(N), which is decent enough in most cases even though it is not the optimal one (for example, with a segment tree built, the time complexity can decrease down to O(log(N))). However, how about we need to query the array N times? If we continue to use the naïve way above, then the time complexity is O(N^2), since for each query we need to scan the query range once...
Post a Comment
Read more

Bit Manipulation - Example

  Leetcode 136 Single Number Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Constraints: 1 <= nums.length <= 3 * 10^4 -3 * 10^4 <= nums[i] <= 3 * 10^4 Each element in the array appears twice except for one element which appears only once. Analysis: If there is no space limitation, this question can be solved by counting easily. But counting requires additional space. Here we can use xor (^) operation based on some interesting observations:  A^A = 0, here A is any number A^0 = A, here A is any number Since all the number appears twice except one, then all the number appear even numbers will be cancelled out, and only the number appears one time is left, which is what we want. See the code below: class Solution { public: int singleNumber(vector<int>& nums) { int res = 0; for(auto ...
Post a Comment
Read more

Rolling Hash

Rolling hash is one common trick used to increase efficiency of substring comparisons by compressing (or hashing) a string into a integer. After this step, we can compare two strings directly without comparing each chars. So the efficiency can be increased from O(N) to O(1). So how to implement the rolling hash? First we need to choose a base for the expansion and a modulo to mod. The basic formula is (suppose the window is n, and the rolling direction is from left to right), HashVal = (A1*p^(n-1) + A2*p^(n-2) + ... + An-1*p^1 + An*p^0)%mod where HashVal is the hash value, Ai is the ith element, p is the base, and mod is the modulo. To avoid collision as much as we can, p and modulo usually need to be large prime numbers. One corner case is that the base order in the above formula cannot be reversed. Or to be more clear, if the rolling direction is from left to right in an array, the first element should be in the highest order of the base, or times p^(n-1), and the last element times ...
Post a Comment
Read more