Count the frequency of each character in s. Then iterate through order. For each character in order, append all its copies to the result.
After you've gone through order, append any remaining characters that weren't in order. These can appear in any position since the problem doesn't constrain them.
This is a counting sort adapted to a custom ordering. You never compare characters directly.