oj.uz

Submission #1004327

# Submission time Handle Problem Language Result Execution time Memory
1004327 2024-06-21T07:47:21 Z vjudge1 Kitchen (BOI19_kitchen) C++17
0 / 100
 0 ms 348 KB 
#pragma GCC optimize("-O3")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define p_b pop_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
void solve()
{
    ll n, m, k, i, j;
    cin >> n >> m >> k;
    ll a[n+5], b[m+5], c[m+5];
    for(i = 1; i <= n; i++)
        cin >> a[i];
    for(i = 1; i <= m; i++){
        cin >> b[i];
        c[i] = b[i];
    }
    ll sum = 0;
    for(i = 1; i <= n; i++)
        sum += a[i];
    sort(a+1, a+n+1);
    sort(b+1, b+n+1);
    sum = 0;
    j = 1;
    for(i = n; i >= 1; i--)
    {
        while(a[i] && j <= m){
            ll f = min(a[i], b[j]);
            a[i] -= f;
            b[j] -= f;
            if(b[j] == 0)
                j++;
        }
    }
    ll sum1 = 0, sum2 = 0;
    for(i = 1; i <= n; i++)
        sum1 += a[i];
    if(sum1 > 0)
        cout << "Impossible\n";
    else
    {
        ll res = 0;
        for(i = 1; i <= m; i++)
        {
            if(c[i] != b[i] && b[i] > 0)
                res += b[i];
        }
        cout << res << "\n";
    }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll tests = 1;
    //cin >> tests;
    while(tests--)
    {
        solve();
    }
}

Compilation message

kitchen.cpp: In function 'void solve()':
kitchen.cpp:48:18: warning: unused variable 'sum2' [-Wunused-variable]
   48 |     ll sum1 = 0, sum2 = 0;
      |                  ^~~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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