Sắp xếp theo mảng khác

from collections import Counter

def sort_by_order(arr1, arr2):
    # Optimized: Use hash map for frequency counting
    counts = Counter(arr1)
    res = []
    
    # Process elements in order of arr2
    for x in arr2:
        if x in counts:
            res.extend([x] * counts[x])
            del counts[x]
            
    # Process remaining elements sorted
    remaining = sorted(counts.elements())
    return res + remaining

def sort_by_order(arr1, arr2):
    # Brute force: Build result by searching arr2 elements in arr1
    res = []
    visited = [False] * len(arr1)
    
    for x in arr2:
        for i in range(len(arr1)):
            if arr1[i] == x:
                res.append(arr1[i])
                visited[i] = True
                
    # Add remaining elements in sorted order
    remaining = sorted([arr1[i] for i in range(len(arr1)) if not visited[i]])
    return res + remaining