Submission #1339797

#	Time	Username	Problem	Language	Result	Execution time	Memory
1339797		darius1414	Simfonija (COCI19_simfonija)	C++20	0 / 110	61 ms	3536 KiB

simfonija

#include <iostream>
#include <algorithm>
#define nmx 100005
#define inf 1e17
using namespace std;
long long n,k,a[nmx],b[nmx],dif[nmx],sp[nmx],rsp;
int main()
{
    rsp=inf;
    cin>>n>>k;
    for (int i=1; i<=n; i++)
        cin>>a[i];
    for (int i=1; i<=n; i++)
    {
        cin>>b[i];
        dif[i]=b[i]-a[i];
        sp[i]=sp[i-1]+dif[i];
    }
    sort (dif+1,dif+n+1);
    int st=1,dr=n-k;
    while (dr<=n)
    {
        int mid=(st+dr)/2;
        ///le adaug mid
        long long s=(sp[dr]-sp[mid-1])-dif[mid]*(dr-mid+1)+dif[mid]*(mid-st)-(sp[mid-1]-sp[st-1]);
        if ((st+dr)%2==0)
        {
            mid++;
            s=min(s,(sp[dr]-sp[mid-1])-dif[mid]*(dr-mid+1)+dif[mid]*(mid-st)-(sp[mid-1]-sp[st-1]));
        }
        rsp=min(rsp,s);
        dr++;
        st++;
    }
    cout<<rsp;
}

• 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