oj.uz

Submission #956948

# Submission time Handle Problem Language Result Execution time Memory
956948 2024-04-02T17:50:01 Z FEDIKUS Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100100;

int n;
int A[MAX_N], B[MAX_N];

int main()
{
    // Ulaz
    cin>>n;

    for(int i=0;i<n;i++)
    {
        cin>>A[i];
    }
    for(int i=0;i<n;i++)
    {
        cin>>B[i];
    }

    // Obrada
    sort(A, A+n);
    sort(B, B+n);

    int rez = 0;
    int profit = 0, loss = 0;
    int sumA = 0, sumB = 0;
    int a = n-1, b = n-1;
    while(a != -1 and b != -1)
    {
        loss++;

        if(sumA <= sumB)
        {
          if(a==-1) break;
            sumA += A[a];
            profit += A[a];
            a--;
        }
        else
        {
          if(b==-1) break;
            sumB += B[b];
            profit += B[b];
            b--;
        }

        if(profit - loss > rez)
        {
            rez = profit - loss;
        }
    }

    // Izlaz
    cout<<rez<<endl;

    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -