제출 #676433

#제출 시각아이디문제언어결과실행 시간메모리
676433Essa2006Simfonija (COCI19_simfonija)C++14
110 / 110
26 ms1108 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) const int inf = 1e18; signed main(){ ios_base::sync_with_stdio(0);cin.tie(0); int n, k; cin>>n>>k; vector<int>Pre(n); for(int i=0;i<n;i++){ cin>>Pre[i]; } for(int i=0, a;i<n;i++){ cin>>a; Pre[i]-=a; } sort(all(Pre)); int ans=inf; for(int i=1;i<n;i++) Pre[i]+=Pre[i-1]; for(int i=0, r=n-k-1, md=(n-k)/2;r<n;i++, r++, md++){ int val=Pre[md]-(md?Pre[md-1]:0); int sum=(md-i+1)*val-(Pre[md]-(i?Pre[i-1]:0))+(r+1?Pre[r]:0)-Pre[md]-val*(r-(md+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...