Submission #1328966

#	Time	Username	Problem	Language	Result	Execution time	Memory
1328966		Muhammad_Aneeq	Simfonija (COCI19_simfonija)	C++20	44 / 110	25 ms	1856 KiB

simfonija

#include <bits/stdc++.h>
using namespace std;
inline void solve()
{
    int n,k;
    cin>>n>>k;
    int a[n],b[n];
    for (int i=0;i<n;i++)
        cin>>a[i];
    for (int i=0;i<n;i++)
        cin>>b[i];
    vector<int>z;
    for (int i=0;i<n;i++)
        z.push_back(b[i]-a[i]);
    sort(begin(z),end(z));
    int x=n/2;
    int vl=z[x];
    z={};
    long long sm=0;
    for (int i=0;i<n;i++)
    {
        a[i]+=vl;
        z.push_back(abs(a[i]-b[i]));
        sm+=abs(a[i]-b[i]);
    }
    sort(begin(z),end(z));
    reverse(begin(z),end(z));
    for (int i=0;i<k;i++)
    {
        sm-=z[i];
    }
    cout<<sm<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int t=1;
    for (int i=1;i<=t;i++)
    {
        solve();
    }
}

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 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