C++(g++ 7.5.0) 解法, 执行用时: 237ms, 内存消耗: 784K, 提交时间: 2022-08-22 19:52:55

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n,m,a[N],sum[N],c;
int main(){
    while(~scanf("%d%d%d",&n,&m,&c)){
        for(int i=1;i<=n;i++) scanf("%d",&a[i]),a[i]+=a[i-1];
        sort(a,a+n+1);
        long long ans = 0;
        for(int i=1;i<=m;i++){
            if(a[n-i+1] - a[i-1] < c) break;
            else ans += a[n-i+1]-a[i-1] - c;
        }
        printf("%lld\n",ans);
    }
    return 0;
}

C++14(g++5.4) 解法, 执行用时: 359ms, 内存消耗: 1144K, 提交时间: 2019-10-04 15:50:47

#include<bits/stdc++.h>
using namespace std;
int i,i0,n,m,T,ans,c,x;
long long pre[100005];
int main() {
    while(~scanf("%d %d %d",&n,&m,&c)) {
        pre[0]=0;
        for(i=1; i<=n; i++)scanf("%d",&x),pre[i]=pre[i-1]+x;
        sort(pre,pre+1+n);
        long long ans=0;
        for(i=0; i<m; i++)ans+=max(0ll,pre[n-i]-pre[i]-c);
        printf("%lld\n",ans);
    }
    return 0;
}

C++ 解法, 执行用时: 491ms, 内存消耗: 1172K, 提交时间: 2022-07-25 20:02:21

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ll a[100005];
    int n, m, c;
    while(cin >> n >> m >> c)
    {
        ll num = 0;
        for (int i = 1; i <= n; i ++ ) cin >> a[i], a[i] += a[i - 1];
        sort(a, a + n + 1);
        for (int i = 0; i < m; i ++ ) num += max(0LL, abs(a[n - i] - a[i]) - c);
        cout << num << endl;
    }
}