oj.uz

Submission #790242

# Submission time Handle Problem Language Result Execution time Memory
790242 2023-07-22T13:07:49 Z n3rm1n Stove (JOI18_stove) C++17
0 / 100
 0 ms 212 KB 
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN = 1e5 + 10;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
int n, k, a[MAXN];

void read()
{
    cin >> n >> k;
    for (int i = 1; i <= n; ++ i)
        cin >> a[i];
}

void solve()
{
    vector < int > g;
    int ans = a[n] - a[1];
    for (int i = 2; i <= n; ++ i)
    {
        g.push_back(- max(0, a[i] - a[i-1] - 1));
    }
    sort(g.begin(), g.end());
    int i = 1;
    while(i < k)
    {
        ans += g[i];
        i ++;
    }
    cout << ans << endl;
}
int main()
{
    speed();

    read();
    solve();
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -