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

int main()
{
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    int sumA = 0, sumB = 0;
    for (auto &i : a)
        cin >> i, sumA += i;
    for (auto &i : b)
        cin >> i, sumB += i;

    int ans = min(sumA, sumB), mask = (1 << n);
    for (int i = 0; i < mask; ++i)
    {
        int curr = 0, currentB = 0;
        for (int j = 0; j < n; ++j)
        {
            if (i & (1 << j))
            {
                curr += a[j];
            }
            else
            {
                currentB += b[j];
            }
        }
        ans = max(ans, min(curr, currentB));
    }
    cout << ans << endl;

    return 0;
}
// game
flipkart ✅

Juspay Hiring Challenge 2024

Batch eligible: 2024 and 2025 grads

Round:
1) MCQ
2) Coding
3) Final Interview

CTC: 21-27 Lakh
Stipend: 40k per month

Apply: https://unstop.com/o/y9PvMOt?lb=Mgx4BsU&utm_medium=Share&utm_source=shortUrl

Open Positions Available:

    - Front-End Developers : Build intuitive and visually stunning web applications.

    - Flutter Developers : Create cutting-edge mobile applications.

Interns : Also welcome to apply

Apply Here : https://docs.google.com/forms/d/e/1FAIpQLScxv1xGftiuF34-Z-2pXzEQWrNHP2echXw6mZnTL4O4MefZsA/viewform

Need SAP Certified Freshers for Quints Global | Location: Okhla, New Delhi* 💥💥💥

Positions available:
1. SAP SD Management Trainee.
2. SAP FICO Management Trainee.
3. SAP MM Management Trainee.

Qualification: BCA/ MCA/ B Tech.

Date of Interview: 5th & 6th September

Venue: Quints Global Pvt. Ltd., 3rd Floor, 12 A Pride Tower, Near Kotak Mahindra, Sector- 125, Noida, Nearest Metro: Okhla Bird Sanctuary.

Apply, if interested!!

def solve(histogram):
    a = 0
    n = len(histogram)
    for i in range(n):
        m = histogram[i]
        for j in range(i, n):
            m = min(m, histogram[j])
            s = min(m, j - i + 1)
            w = s * s
            a = max(a, w)
    return a

Visa ✅

int webdev(int numProject,vector<int>projectId,vector<int>bid){
    vector<int>ans(numProject,INT_MAX);
    for(int i=0; i<projectId.size(); i++){
        ans[projectId[i]]=min(ans[projectId[i]], bid[i]);
    }
    int sum=0;
    for(auto x: ans){
        if(x!=INT_MAX)
        sum+=x;
        else
        return -1;
    }

American Express is hiring for multiple roles

For 2022, 2023 grads

https://www.linkedin.com/posts/satvik-jain-a939b4212_apply-to-team-amex-activity-7236473446245818368-beDQ?utm_source=share&utm_medium=member_android

Bungee Tech is hiring SDE intern

For 2024, 2025 grads
Location: Remote


https://www.linkedin.com/jobs/view/4013961516