이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll n,k;
pair<ll,ll>a[100005];
bool mys(pair<ll,ll>a,pair<ll,ll>b){
ll x=abs(a.first-a.second);
ll y=abs(b.first-b.second);
return x>y;
}
ll ans=0;
int main(){
cin>>n>>k;
for(ll i=0;i<n;i++){
cin>>a[i].first;
}
for(ll i=0;i<n;i++){
cin>>a[i].second;
}
sort(a,a+n,mys);
ll mid1=0,mid2=0;
for(ll i=k;i<n;i++){
mid1+=a[i].first;
mid2+=a[i].second;
}
ll m=n-k;
mid1=(long double)(mid1*1.0/m+0.5);
mid2=(long double)(mid2*1.0/m+0.5);
ll x=mid1-mid2;
//cout<<mid1<<' '<<mid2<<' '<<x<<endl;
for(ll i=k;i<n;i++){
ans+=abs(x+a[i].second-a[i].first);
}
cout<<ans<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |