제출 #1328997

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1328997		Muhammad_Aneeq	Simfonija (COCI19_simfonija)	C++20	110 / 110	21 ms	2752 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;
    long long ans=0;
    for (int i=0;i<n;i++)
    {
        z.push_back(b[i]-a[i]);
        ans+=abs(b[i]-a[i]);
    }
    sort(begin(z),end(z));
    vector<long long>pre={0};
    for (auto i:z)
        pre.push_back(pre.back()+i);
    for (int i=0;i<=k;i++)
    {
        int l=i,r=n-(k-i)-1;
        int md=(l+r)/2;
        int vl=z[md];
        long long val=pre[r+1]-pre[md]-(vl*(r+1-md));
        long long val1=pre[md+1]-pre[l]-(vl*(md+1-l));
        val-=val1;
        ans=min(ans,val);
    }
    cout<<ans<<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: 11 / 11
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 11 / 11
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11