#include <vector>
#include <algorithm>

using namespace std;

bool c(const vector<int>& a, const vector<int>& b) {
return a[0] > b[0];
}

int solve(int n, int t, vector<vector<int>>& d) {
sort(d.begin(), d.end(), c);
long long r = t;
long long ans = 0;

while (r > 0) {
int p = -1;
for (int i = 0; i < n; ++i) {
if (d[i][1] > 0 && r % d[i][0] == 0) {
p = i;
break;
}
}

if (p == -1) return -1;

long long u = min(r / d[p][0], (long long)d[p][1]);
r -= u * d[p][0];
ans += u;
d[p][1] -= u;
}

return ans;
}

Infosys SP ✅

🚨 Need Help with Coding?

💻 Live Coding | Projects | Interviews | OA & Hackathons

💯 Expert Assistance Available

📩 DM: @codemaster004

🔥 HCLTech is Hiring! 🔥

💻 Role:
* Freshers Hiring / Off-Campus Drive
* India

🎓 Eligibility:
* Batch: 2026
* Freshers

📌 Key Requirements:
* Good understanding of foundational software engineering concepts
* Strong analytical and communication skills

👇 Click below to apply:
🔗 Application Link : https://freshers.hcltech.com/?utm_source=OffCampus&utm_medium=OffCampus_T1Institutions_Batch2026&utm_campaign=OffCampus_T1Institutions_Batch2026&utm_term=HCLTech


💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help

📩 DM: @codemaster004

import java.util.*;

class Main {
public static int solve(int n, int[] w1, int[] v1, int[] w2, int[] v2, int c) {
int[] dp = new int[c + 1];

for (int i = 0; i < n; i++) {
for (int w = c; w >= 0; w--) {
int maxVal = dp[w];

if (w >= w1[i]) {
maxVal = Math.max(maxVal, dp[w - w1[i]] + v1[i]);
}

if (w >= w2[i]) {
maxVal = Math.max(maxVal, dp[w - w2[i]] + v2[i]);
}

dp[w] = maxVal;
}
}

return dp[c];
}

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
if (!sc.hasNextInt()) return;

int n = sc.nextInt();

int[] w1 = new int[n];
for (int i = 0; i < n; i++) w1[i] = sc.nextInt();

int[] v1 = new int[n];
for (int i = 0; i < n; i++) v1[i] = sc.nextInt();

int[] w2 = new int[n];
for (int i = 0; i < n; i++) w2[i] = sc.nextInt();

int[] v2 = new int[n];
for (int i = 0; i < n; i++) v2[i] = sc.nextInt();

int c = sc.nextInt();

int result = solve(n, w1, v1, w2, v2, c);
System.out.println(result);

sc.close();
}
}

INFOSYS ✅


💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help

📢 DM @Codemaster004

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

long long solve(int n, vector<vector<int>>& g) {
if (n == 0) return 0;
vector<vector<long long>> dp(n, vector<long long>(n, -2e18));
dp[0][0] = g[0][0];

for (int s = 1; s <= 2 * n - 2; ++s) {
vector<vector<long long>> ndp(n, vector<long long>(n, -2e18));
int mn = max(0, s - n + 1);
int mx = min(s, n - 1);

for (int x1 = mn; x1 <= mx; ++x1) {
for (int x2 = mn; x2 <= mx; ++x2) {
int y1 = s - x1;
int y2 = s - x2;
long long prv = -2e18;

if (x1 > 0 && x2 > 0) prv = max(prv, dp[x1 - 1][x2 - 1]);
if (x1 > 0 && y2 > 0) prv = max(prv, dp[x1 - 1][x2]);
if (y1 > 0 && x2 > 0) prv = max(prv, dp[x1][x2 - 1]);
if (y1 > 0 && y2 > 0) prv = max(prv, dp[x1][x2]);

if (prv != -2e18) {
long long val = g[x1][y1];
if (x1 != x2) val += g[x2][y2];
ndp[x1][x2] = prv + val;
}
}
}
dp = ndp;
}
return dp[n - 1][n - 1];
}

int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);

int n;
if (cin >> n) {
vector<vector<int>> g(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> g[i][j];
}
}

auto result = solve(n, g);
cout << result << "\n";
}
return 0;
}

Infosys ✅

💻 Live Coding Test | Projects | Interviews | OA & Hackathons Help

📢 DM @Codemaster004