原题:http://202.197.224.59/OnlineJudge2/index.php/Problem/read/id/1264
#include<cstdio>
#include<queue>
#include<iostream>
#include<vector>
#include<map>
#include<cstring>
#include<string>
#include<set>
#include<stack>
#include<algorithm>
#define cle(a) memset(a,0,sizeof(a))
#define inf(a) memset(a,ox3f,sizeof(a))
#define ll long long
#define Rep(i,a,n) for(int i=a;i<=n;i++)
using namespace std;
const int INF = ( 2e9 ) + 2;
const int maxn = 1e5+10;
ll pre[maxn];
int main()
{
int n,m,C;
// freopen("in.txt","r",stdin);
while(~scanf("%d%d%d",&n,&m,&C))
{
pre[0]=0;
for(int i=1;i<=n;i++)
{
int a;
scanf("%d",&a);
pre[i]=pre[i-1]+a;
}
sort(pre,pre+n+1);
ll ans=0,Max=0;
for(int i=0;i<m;i++)
{
ll t=pre[n-i]-pre[i];
ans+=(t-C);
Max=max(Max,ans);
}
printf("%I64d\n",Max);
}
}