Leet Code Daily 2024-06-11 - Relative Sort Array

class Solution {
public:
    vector<int> relativeSortArray(vector<int>& arr1, vector<int>& arr2) {
        map<int, int> freq;
        for (const auto& x : arr1) {
            freq[x]++;
        }
        vector<int> ans;
        for (const auto& x : arr2) {
            while (freq[x]-- > 0) {
                ans.push_back(x);
            }
        }
        for (const auto& p : freq) {
            const int x = p.first;
            while (freq[x]-- > 0) {
                ans.push_back(x);
            }
        }
        return ans;
    }
};