𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

public static int solution(int N, int K, int[] cost, int[] sell) {
        int maxProfit = 0;
        List<Item> items = new ArrayList<>();

        for (int i = 0; i < N; i++) {
            items.add(new Item(cost[i], sell[i]));
        }

        Collections.sort(items, Comparator.comparingInt(Item::getSellPrice));

        int low = 0, high = items.size() - 1;

        while (low <= high) {
            int mid = low + (high - low) / 2;
            int buyingPrice = items.get(mid).getBuyPrice();

            if (K >= buyingPrice) {
                maxProfit = Math.max(maxProfit, items.get(mid).getSellPrice() - buyingPrice);
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }

        return maxProfit;
    }
}

class Item {
    private int buyPrice;
    private int sellPrice;

    public Item(int buyPrice, int sellPrice) {
        this.buyPrice = buyPrice;
        this.sellPrice = sellPrice;
    }

    public int getBuyPrice() {
        return buyPrice;
    }

    public int getSellPrice() {
        return sellPrice;
    }
}

Profits ✅

👍1

567 viewsDushyant, edited 08:56