ProtyayMnd50 / hello.cpp

#include <iostream> #include <vector> #include <algorithm> #include <climits> #include <bits/stdc++.h> using namespace std; #define ll long long # updated ll minCostProduct(const vector<vector<ll>> &seg) { int n = seg.size(); // Sort by starting endpoint (L) vector<vector<ll>> sortedL = seg; sort(sortedL.begin(), sortedL.end(), [](const vector<ll> &a, const vector<ll> &b) { if (a[0] != b[0]) return a[0] < b[0]; return a[1] < b[1]; }); // Sort by ending endpoint (R) vector<vector<ll>> sortedR = seg; sort(sortedR.begin(), sortedR.end(), [](const vector<ll> &a, const vector<ll> &b) { if (a[1] != b[1]) return a[1] < b[1]; return a[0] < b[0]; }); ll minCost = LLONG_MAX; // Minimum cost of valid non-overlapping segments ll minProd = LLONG_MAX; // Minimum product of costs for valid pairs int r = 0; // Iterate over sortedL (by left endpoint) for (const auto &cur : sortedL) { // Check for valid non-overlapping segments (sortedR's R < cur.L) while (r < n && sortedR[r][1] < cur[0]) { minCost = min(minCost, sortedR[r][2]); // sortedR[r][2] is the cost ++r; } // Calculate the product of costs if a valid segment is found if (minCost != LLONG_MAX) { ll prod = minCost * cur[2]; minProd = min(minProd, prod); } } // Return the result return (minProd != LLONG_MAX) ? minProd : -1; // Return -1 if no valid pair is found }

int findMinPairingCost(const vector<Segment>& segments) { int minCost = INT_MAX; int n = segments.size(); if (n < 2) return -1; vector<Segment> sortedSegments = segments; sort(sortedSegments.begin(), sortedSegments.end(), [](const Segment& a, const Segment& b) { return a.R < b.R || (a.R == b.R && a.L < b.L); }); int minSingleCost = INT_MAX; for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { if (sortedSegments[j].R < sortedSegments[i].L) { int pairCost = sortedSegments[i].cost * sortedSegments[j].cost; minCost = min(minCost, pairCost); } } } return minCost == INT_MAX ? -1 : minCost; }

int minMoves(vector<int>arr, int n, int k) { sort(arr.begin(), arr.end()); int i = 0, j = n - 1; int moves = 0; while (i <= j) { if (arr[i] + arr[j] <= k) { i++; } j--; moves++; } return moves; }