-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtraining.cpp
45 lines (42 loc) · 931 Bytes
/
training.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
struct pr{
ll f,b;
};
int main()
{
ll t;
cin >> t;
for(ll _ = 1;_<=t;++_)
{
ll n, p;
cin >> n >> p;
ll *skill = new ll[n];
for(ll i = 0; i < n; i++){
cin >> skill[i];
}
sort(skill,skill+n);
pr q;
ll i,j;
q.f = 0;
q.b = p-1;
ll cost = 0;
ll mincost = INT_MAX;
for(i=0;i<p;++i)
{
cost += skill[q.b]-skill[i];
}
mincost=min(cost,mincost);
for(j=p;j<n;++j)
{
cost -= (skill[q.b]-skill[q.f]);
cost+=(skill[j]-skill[q.b])*(p-1);
q.f++;
q.b++;
mincost=min(cost,mincost);
}
cout<<"Case #"<<_<<": "<<mincost<<"\n";
}
return 0;
}