| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1339800 | darius1414 | Simfonija (COCI19_simfonija) | C++20 | 53 ms | 3540 KiB |
#include <iostream>
#include <algorithm>
#define nmx 100005
#define inf 1e17
using namespace std;
long long n,k,a[nmx],b[nmx],dif[nmx],sp[nmx],rsp;
int main()
{
rsp=inf;
cin>>n>>k;
for (int i=1; i<=n; i++)
cin>>a[i];
for (int i=1; i<=n; i++)
{
cin>>b[i];
dif[i]=b[i]-a[i];
}
sort (dif+1,dif+n+1);
for (int i=1;i<=n;i++)
sp[i]=sp[i-1]+dif[i];
if (n==k)
{
cout<<0;
return 0;
}
int st=1,dr=n-k;
while (dr<=n)
{
int mid=(st+dr)/2;
///le adaug mid
long long s=(sp[dr]-sp[mid-1])-dif[mid]*(dr-mid+1)+dif[mid]*(mid-st)-(sp[mid-1]-sp[st-1]);
rsp=min(rsp,s);
dr++;
st++;
}
cout<<rsp;
}
| # | 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... | ||||
