제출 #676431

#제출 시각아이디문제언어결과실행 시간메모리
676431Essa2006Simfonija (COCI19_simfonija)C++14
0 / 110
26 ms3668 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define endl '\n' #define FF first #define SS second #define all(a) a.begin(), a.end() #define mod (int)(1000000007) signed main(){ ios_base::sync_with_stdio(0);cin.tie(0); int n, k; cin>>n>>k; vector<int>A(n); for(int i=0;i<n;i++){ cin>>A[i]; } for(int i=0, a;i<n;i++){ cin>>a; A[i]-=a; } sort(all(A)); vector<int>Pre(n); Pre[0]=A[0]; int ans=1e18; for(int i=1;i<n;i++) Pre[i]=Pre[i-1]+A[i]; int md=(n-k)/2; for(int i=0, r=n-k-1;i<n;i++, r++){ int ind=md+i, val=A[ind]; int sum=(ind-i+1)*val-(Pre[ind]-(i?Pre[i-1]:0))+(r+1?Pre[r]:0)-Pre[ind]-val*(r-(ind+1)+1); ans=min(ans, sum); } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...