oj.uz

Submission #571105

# Submission time Handle Problem Language Result Execution time Memory
571105 2022-06-01T09:03:22 Z Farhan_HY Simfonija (COCI19_simfonija) C++14
0 / 110
 36 ms 6980 KB 
#include <bits/stdc++.h>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;
/// Benzema in the best player in the world
const int inf = 8e18;
const int N = 4e6 + 6;
const int M = 1e3 + 3;
const int LOG = 31;
const int mod = 1e9 + 7;
const float pi = atan(1) * 4;
int n, k, a[N], b[N];
int cnt[N];
vector<int> v;

main()
{
    IOS
    cin >> n >> k;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    for(int i = 1; i <= n; i++)
        cin >> b[i];
    int neg = 0, pos = 0, negn = 0, posn = 0, zn = 0;
    int sum = 0;
    for(int i = 1; i <= n; i++)
    {
        if (a[i] < b[i])
            neg += b[i] - a[i], negn++, cnt[b[i] - a[i]]++;
        else if (a[i] > b[i])
            pos += a[i] - b[i], posn++;
        else
            zn++;
        sum += abs(a[i] - b[i]);
    }
    int x = 0, ans = sum;
    for(int i = 1; i <= 2e6 + 2; i++)
    {
        neg -= negn;
        negn -= cnt[i];
        pos += posn + zn;
        zn = cnt[i];
        if (neg + pos < ans)
            x = i, ans = neg + pos;
    }
    neg = 0, negn = 0, pos = 0, posn = 0, zn = 0, sum = 0;
    for(int i = 1; i <= n; i++)
    {
        if (a[i] > b[i])
            neg += a[i] - b[i], negn++, cnt[a[i] - b[i]]++;
        else if (a[i] < b[i])
            pos += b[i] - a[i], posn++;
        else
            zn++;
        sum += abs(a[i] - b[i]);
    }
    for(int i = 1; i <= 2e6 + 2; i++)
    {
        neg -= negn;
        negn -= cnt[i];
        pos += posn + zn;
        zn = cnt[i];
        if (neg + pos < ans)
            x = -i, ans = neg + pos;
    }
    ans = 0;
    for(int i = 1; i <= n; i++)
        a[i] += x, v.pb(abs(a[i] - b[i])), ans += abs(a[i] - b[i]);
    sort(v.begin(), v.end(), greater<int>());
    for(int i = 0; i < k; i++)
        ans -= v[i];
    cout << ans;
}
///use scanf

Compilation message

simfonija.cpp:22:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 | main()
      | ^~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 340 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Incorrect 7 ms 372 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #1
0 / 11.0

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

Subtask #1
0 / 11.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3012 KB Output is correct
2 Correct 28 ms 3028 KB Output is correct
3 Incorrect 31 ms 4708 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 11.0

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

Subtask #8
0 / 11.0

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

Subtask #9
0 / 11.0

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

Subtask #10
0 / 11.0

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