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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
| #include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 5e5 + 10;
struct Node
{
int p, l, r;
} q[N];
int hd, tl;
struct Data
{
int t;
LL s;
friend bool operator<(const Data &x, const Data &y)
{
return x.s < y.s || (x.s == y.s && x.t < y.t);
}
friend Data operator+(const Data &x, const LL &k)
{
return (Data){x.t + 1, x.s + k};
}
} f[N];
LL s[N];
int n, m, d[N];
Data cal(int k, int i)
{
int mid = i + k + 1 >> 1;
return f[k] + (s[i] + s[k] - 2 * s[mid] + (i + k & 1) * d[mid]);
}
void check(LL x)
{
hd = 1, tl = 0;
q[++tl] = (Node){0, 1, n};
for (int i = 1; i <= n; i++)
{
while (hd <= tl && q[hd].r < i)
hd++;
f[i] = cal(q[hd].p, i);
f[i].s += x;
int p = n + 1;
while (hd <= tl && cal(i, q[tl].l) < cal(q[tl].p, q[tl].l))
p = q[tl--].l;
if (hd <= tl && cal(i, q[tl].r) < cal(q[tl].p, q[tl].r))
{
int l = q[tl].l, r = q[tl].r;
while (l <= r)
{
int mid = l + r >> 1;
cal(i, mid) < cal(q[tl].p, mid) ? (p = mid, r = mid - 1) : l = mid + 1;
}
q[tl].r = p - 1;
}
if (p <= n)
q[++tl] = (Node){i, p, n};
}
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &d[i]);
sort(d + 1, d + n + 1);
for (int i = 1; i <= n; i++)
s[i] = s[i - 1] + d[i];
LL l = 0, r = 5e11, res;
while (l <= r)
{
LL mid = l + r >> 1;
check(mid);
f[n].t <= m ? (res = f[n].s - mid * m, r = mid - 1) : l = mid + 1;
}
printf("%lld", res);
return 0;
}
|