제출 #101274

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
101274		mayhoubsaleh	Simfonija (COCI19_simfonija)	C++14	0 / 110	114 ms	2564 KiB

simfonija

#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;
int n,k;
pair<int,int>a[100005];
bool mys(pair<int,int>a,pair<int,int>b){
    int x=abs(a.first-a.second);
    int y=abs(b.first-b.second);
    return x>y;
}
int ans=0;
int main(){
    cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>a[i].first;
    }
    for(int i=0;i<n;i++){
        cin>>a[i].second;
    }
    sort(a,a+n,mys);
    int mid1=0,mid2=0;
    for(int i=k;i<n;i++){
        mid1+=a[i].first;
        mid2+=a[i].second;
    }
    int m=n-k;
    mid1=(double)(mid1*1.0/m+0.5);
    mid2=(double)(mid2*1.0/m+0.5);

    int x=mid1-mid2;
    //cout<<mid1<<' '<<mid2<<' '<<x<<endl;
    for(int i=k;i<n;i++){
        ans+=abs(x+a[i].second-a[i].first);
    }
    cout<<ans<<endl;
    return 0;
}


//ofstream fout("planting.out");
//ifstream fin("planting.in");

• 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