Electronics Shop - HackerRank || HackerRank Electronics Shop Solution

#include <stdio.h>

int main()
{
    int b, m, n, max = -1, i, j;
    scanf("%d %d %d", &b, &m, &n);
    int keyboard[m], usb[n];
    for (i = 0; i < m; i++) scanf("%d", &keyboard[i]);
    for (i = 0; i < n; i++) scanf("%d", &usb[i]);
    for (i = 0; i < m; i++)
    {
        for (j = 0; j < n; j++)
        {
            if (keyboard[i] + usb[j] <= b)
            {
                if (keyboard[i] + usb[j] >= max) max = keyboard[i] + usb[j];
            }
        }
    }
    printf("%d\n", max);

    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int b, m, n, i, j, max = -1;
    cin >> b >> m >> n;
    int keyboard[m], usb[n];
    for (i = 0; i < m; i++) cin >> keyboard[i];
    for (i = 0; i < n; i++) cin >> usb[i];
    for (i = 0; i < m; i++)
    {
        for (j = 0; j < n; j++)
        {
            if (keyboard[i] + usb[j] <= b)
            {
                if (keyboard[i] + usb[j] >= max) max = keyboard[i] + usb[j];
            }
        }
    }
    cout << max << endl;

    return 0;
}

import java.util.Scanner;

public class Electronics_Shop {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int balance = input.nextInt();
        int m = input.nextInt();
        int n = input.nextInt();
        int[] keyboard = new int[m];
        int[] usb = new int[n];
        for (int i = 0; i < m; i++) keyboard[i] = input.nextInt();
        for (int i = 0; i < n; i++) usb[i] = input.nextInt();
        int maximum = -1;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (keyboard[i] + usb[j] <= balance) {
                    if (keyboard[i] + usb[j] >= maximum) maximum = keyboard[i] + usb[j];
                }
            }
        }
        System.out.println(maximum);
    }
}