class Solution {
public:
    vector<int> minWaitingTime(vector<int>& times, vector<int>& costs) {
        int n = times.size();
        vector<pair<double, int>> ratios(n);
        
        // 计算每个顾客的时间/成本比
        for (int i = 0; i < n; i++) {
            ratios[i] = {(double)times[i] / costs[i], i};
        }
        
        // 按比值升序排序
        sort(ratios.begin(), ratios.end());
        
        // 返回顾客的服务顺序
        vector<int> order(n);
        for (int i = 0; i < n; i++) {
            order[i] = ratios[i].second;
        }
        
        return order;
    }
};

class Solution {
    public int[] minWaitingTime(int[] times, int[] costs) {
        int n = times.length;
        
        // 创建顾客索引数组
        Integer[] indices = new Integer[n];
        for (int i = 0; i < n; i++) {
            indices[i] = i;
        }
        
        // 按时间/成本比升序排序
        Arrays.sort(indices, (i, j) -> {
            double ratio1 = (double)times[i] / costs[i];
            double ratio2 = (double)times[j] / costs[j];
            return Double.compare(ratio1, ratio2);
        });
        
        return Arrays.stream(indices).mapToInt(i -> i).toArray();
    }
}

class Solution:
    def minWaitingTime(self, times: List[int], costs: List[int]) -> List[int]:
        n = len(times)
        
        # 计算每个顾客的时间/成本比，并记录原始索引
        ratios = [(times[i] / costs[i], i) for i in range(n)]
        
        # 按比值升序排序
        ratios.sort()
        
        # 返回顾客的服务顺序
        return [i for _, i in ratios]