# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
703928 | 2023-03-01T03:10:49 Z | chenyan | Simfonija (COCI19_simfonija) | C++17 | 33 ms | 4048 KB |
#include<bits/stdc++.h> using namespace std; #define int long long #define pii pair<int,int> #define ff first #define ss second #define all(x) x.begin(),x.end() #define pb emplace_back #define N 100010 int dp[N],a[N],b[N],p[N]; vector<int>v; signed main(){ ios::sync_with_stdio(0); cin.tie(0); int n,m,i,k,j; cin>>n>>k; for(i=1;i<=n;i++)cin>>a[i]; for(i=1;i<=n;i++)cin>>b[i]; for(i=1;i<=n;i++)a[i]=b[i]-a[i]; sort(a+1,a+n+1); for(i=1;i<=n;i++)p[i]=p[i-1]+a[i]; int l=0,r=n-k,ans=1e18; for(i=1;i<=n;i++){ while(l<i&&r<n&&a[r+1]-a[i]<a[i]-a[l+1])l++,r++; ans=min(ans,(p[r]-p[i])-a[i]*(r-i)+a[i]*(i-l)-(p[i]-p[l])); } cout<<ans<<'\n'; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 2672 KB | Output is correct |
2 | Correct | 21 ms | 2532 KB | Output is correct |
3 | Correct | 21 ms | 2576 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 2596 KB | Output is correct |
2 | Correct | 21 ms | 2632 KB | Output is correct |
3 | Correct | 20 ms | 2636 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 2644 KB | Output is correct |
2 | Correct | 21 ms | 2568 KB | Output is correct |
3 | Correct | 19 ms | 2652 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 2648 KB | Output is correct |
2 | Correct | 19 ms | 2772 KB | Output is correct |
3 | Correct | 23 ms | 2764 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 2640 KB | Output is correct |
2 | Correct | 25 ms | 2772 KB | Output is correct |
3 | Correct | 24 ms | 2756 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 18 ms | 2644 KB | Output is correct |
2 | Correct | 22 ms | 2772 KB | Output is correct |
3 | Correct | 24 ms | 2724 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 2576 KB | Output is correct |
2 | Correct | 22 ms | 3992 KB | Output is correct |
3 | Correct | 33 ms | 3996 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 27 ms | 2584 KB | Output is correct |
2 | Correct | 26 ms | 2664 KB | Output is correct |
3 | Correct | 25 ms | 4048 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 2636 KB | Output is correct |
2 | Correct | 20 ms | 2740 KB | Output is correct |
3 | Correct | 24 ms | 2764 KB | Output is correct |