Submission #571081

#	Time	Username	Problem	Language	Result	Execution time	Memory
571081		Farhan_HY	Simfonija (COCI19_simfonija)	C++14	0 / 110	306 ms	33388 KiB

simfonija

#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 = 1e6 + 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];
map<int, int> cnt;
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, lst = sum;
    for(int i = 1; i <= 2e6; i++)
    {
        neg -= negn;
        negn -= cnt[i];
        pos += posn + zn;
        zn = cnt[i];
        posn += cnt[i - 1];
        if (neg + pos > lst)
            break;
        lst = neg + pos;
        x = i;
    }
    int 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 (stderr)

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

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11