Optimal Product Selection — Problem Statement & Solution Guide

#include <bits/stdc++.h>
using namespace std;

vector<int> optimalProductSelection(const vector<vector<int>>& products, int budget) {
    int bestRating = -1;
    int bestPrice = -1;
    for(const auto& p: products){
        int rating = p[0];
        int price = p[1];
        if(price<=budget){
            if(rating>bestRating){
                bestRating = rating;
                bestPrice = price;
            }
        }
    }
    if(bestRating==-1) return {};
    return {bestRating, bestPrice};
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; if(!(cin>>n)) return 0;
    vector<vector<int>> products(n, vector<int>(2));
    for(int i=0;i<n;++i) cin>>products[i][0]>>products[i][1];
    int budget; cin>>budget;
    vector<int> ans = optimalProductSelection(products, budget);
    if(ans.empty()) cout<<"[]\n";
    else cout<<'['<<ans[0]<<','<<ans[1]<<"]\n";
    return 0;
}

import java.io.*;
import java.util.*;

public class Main {
    public static List<Integer> optimalProductSelection(List<int[]> products, int budget) {
        int bestRating = Integer.MIN_VALUE;
        int bestPrice = -1;
        for(int[] p : products){
            int rating = p[0];
            int price = p[1];
            if(price <= budget && rating > bestRating){
                bestRating = rating;
                bestPrice = price;
            }
        }
        if(bestRating == Integer.MIN_VALUE) return new ArrayList<>();
        List<Integer> res = new ArrayList<>();
        res.add(bestRating);
        res.add(bestPrice);
        return res;
    }

    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line = br.readLine();
        if(line == null) return;
        int n = Integer.parseInt(line.trim());
        List<int[]> products = new ArrayList<>();
        for(int i=0;i<n;i++){
            String[] parts = br.readLine().trim().split("\\s+");
            int rating = Integer.parseInt(parts[0]);
            int price = Integer.parseInt(parts[1]);
            products.add(new int[]{rating, price});
        }
        int budget = Integer.parseInt(br.readLine().trim());
        List<Integer> ans = optimalProductSelection(products, budget);
        if(ans.isEmpty()) System.out.println("[]");
        else System.out.println("["+ans.get(0)+","+ans.get(1)+"]");
    }
}

def optimal_product_selection(products, budget):
    best_rating = -1
    best_price = -1
    for rating, price in products:
        if price <= budget and rating > best_rating:
            best_rating = rating
            best_price = price
    if best_rating == -1:
        return []
    return [best_rating, best_price]

if __name__ == "__main__":
    import sys
    data = sys.stdin.read().strip().splitlines()
    if not data:
        sys.exit()
    idx = 0
    n = int(data[idx]); idx+=1
    products = []
    for _ in range(n):
        rating, price = map(int, data[idx].split()); idx+=1
        products.append([rating, price])
    budget = int(data[idx])
    ans = optimal_product_selection(products, budget)
    if not ans:
        print('[]')
    else:
        print(f'[{ans[0]},{ans[1]}]')

function optimalProductSelection(products, budget) {
    let bestRating = -Infinity;
    let bestPrice = -1;
    for(const [rating, price] of products){
        if(price<=budget && rating>bestRating){
            bestRating = rating;
            bestPrice = price;
        }
    }
    if(bestRating===-Infinity) return [];
    return [bestRating, bestPrice];
}

// Driver (same as template)
const readline = require('readline');
const rl = readline.createInterface({input: process.stdin, output: process.stdout});
let lines = [];
rl.on('line', (line) => { lines.push(line.trim()); });
rl.on('close', () => {
    let idx = 0;
    const n = parseInt(lines[idx++]);
    const products = [];
    for(let i=0;i<n;i++){
        const [rating, price] = lines[idx++].split(/\s+/).map(Number);
        products.push([rating, price]);
    }
    const budget = parseInt(lines[idx++]);
    const ans = optimalProductSelection(products, budget);
    if(ans.length===0) console.log('[]');
    else console.log(`[${ans[0]},${ans[1]}]`);
});