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
| #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
ll n,k,l[(int)1e6+9],r[(int)1e6+9],ans,a[(int)1e6+9];
priority_queue<pair<ll,ll>> q;
bitset<(int)1e6+9> vis;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>k;
for(int i=1;i<=n;++i)l[i]=i-1,r[i]=i+1;
for(ll i=1,x;i<=n;++i){
cin>>a[i];
q.push({a[i],i});
}
while(k&&!q.empty()&&q.top().first>0){
auto [aa,bb]=q.top();
q.pop();
if(vis[bb])continue;
vis[bb]=vis[l[bb]]=vis[r[bb]]=1,ans+=aa,n+=1,k-=1,a[n]=a[l[bb]]+a[r[bb]]-a[bb];
l[n]=l[l[bb]],r[n]=r[r[bb]],r[l[n]]=n,l[r[n]]=n;
q.push({a[n],n});
}
cout<<ans;
return 0;
}
|