oj.uz

Submission #225124

# Submission time Handle Problem Language Result Execution time Memory
225124 2020-04-19T09:43:22 Z kartel Simfonija (COCI19_simfonija) C++14
44 / 110
 49 ms 4472 KB 
#include <bits/stdc++.h>
#define in(x) freopen(x,"r",stdin)
#define out(x) freopen(x,"w",stdout)
#define F first
#define S second
#define pb push_back
#define M ll(998244353)
#define inf ll(2e9+7)
#define N ll(200500)
#define sz(x) x.size()
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
#define el '\n'
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update> os;

ll a[N], b[N], i, n, k, ans = 1e18, kl, sm, sum, c[N], pr[N];
vector <ll> ve;

int main()
{
//    in("input.txt");
//    out("output.txt");

    ios_base::sync_with_stdio(false);
    iostream::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    for (i = 1; i <= n; i++) cin >> a[i];
    for (i = 1; i <= n; i++)
    {
        cin >> b[i];
        c[i] = b[i] - a[i];
    }

    sort(c + 1, c + 1 + n);

    for (i = 1; i <= n; i++) a[i] += c[n / 2];

    for (i = 1; i <= n; i++) ve.pb(b[i] - a[i]);

    sort(ve.begin(), ve.end());

    pr[0] = ve[0];

    for (i = 1; i < n; i++) pr[i] = pr[i - 1] + ve[i];

    ll j = 0;
    while (j < n && ve[j] < 0) j++;

    for (i = 0; i <= k; i++)
    {
        j = max(j, i);
        ans = min(ans, pr[i + n - k - 1] - pr[j - 1] -
                  (pr[j - 1] - pr[i - 1])
                  );
    }

    cout << ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 4336 KB Output is correct
2 Correct 47 ms 4336 KB Output is correct
3 Correct 37 ms 4336 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 4352 KB Output is correct
2 Correct 41 ms 4456 KB Output is correct
3 Correct 38 ms 4336 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 4440 KB Output is correct
2 Correct 43 ms 4336 KB Output is correct
3 Correct 38 ms 4336 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 4344 KB Output is correct
2 Correct 36 ms 4472 KB Output is correct
3 Incorrect 39 ms 4464 KB Output isn't correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 11.0

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

Subtask #8
0 / 11.0

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

Subtask #9
0 / 11.0

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

Subtask #10
0 / 11.0

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