Submission #318884

#TimeUsernameProblemLanguageResultExecution timeMemory
318884nekiSimfonija (COCI19_simfonija)C++14
55 / 110
98 ms4356 KiB
#include <bits/stdc++.h> #define loop(i, a, b) for(long long i=a;i<b;i++) #define pool(i, a, b) for(long long i=a-1;i>=b;i--) #define fore(i, a) for(auto&& i:a) #define fi first #define se second #define ps(a) push_back(a) #define pb(a) pop_back(a) #define sc scanf #define vc vector #define pa pair<ll, ll> #define ll long long #define lb lower_bound #define ub upper_bound #define all(a) a.begin(), a.end() #define llmax LLONG_MAX/2 #define llmin -LLONG_MAX/2 using namespace std; #define mn 100100 #define pa pair<ll, ll> #define ld long double ll a[mn], b[mn], srt[mn]; int main(){ ll n, k;cin>> n >> k; loop(i, 0, n) cin >> a[i]; loop(i, 0, n) cin >> b[i]; loop(i, 0, n) srt[i+1]=b[i]-a[i]; sort(srt+1, srt+n+1); ll j=0, ans=llmax, l=0, r=k, cur=0; loop(i, 1, n-k+1) cur+=srt[i]-srt[1]; loop(j, 0, n){ ll i=srt[j+1]; if(j!=0) cur-=(n-j-j+l-r) * (srt[j+1]-srt[j]); while(l+1<=j and r>0 and i-srt[l+1]>=srt[n+1-r]-i) cur-=srt[n+1-r]+srt[l+1]-2 * i,l++, r--; //cout << i << " "<<cur <<" "<<j<< " "<<l << " "<<r<<endl; ans=min(ans, cur); } cout << ans <<endl; }

Compilation message (stderr)

simfonija.cpp: In function 'int main()':
simfonija.cpp:29:8: warning: unused variable 'j' [-Wunused-variable]
   29 |     ll j=0, ans=llmax, l=0, r=k, cur=0;
      |        ^
#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...