oj.uz

Submission #1004886

# Submission time Handle Problem Language Result Execution time Memory
1004886 2024-06-21T21:52:13 Z MarwenElarbi Stove (JOI18_stove) C++17
100 / 100
 40 ms 2408 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ii pair<int,int>
const int nax=5e2+5;
int main()
{
    
    int n,k;
    cin>>n>>k;
    int tab[n];
    for (int i = 0; i < n; ++i)
    {
        cin>>tab[i];
    }
    vector<int> nabba;
    for (int i = 1; i < n; ++i)
    {
        nabba.pb(tab[i]-tab[i-1]-1);
    }
    sort(nabba.begin(),nabba.end());
    int sum=tab[n-1]+1-tab[0];
    for (int i = nabba.size()-1; i >= (int)nabba.size()-k+1  ; --i)
    {
        sum-=nabba[i];
    }
    cout <<sum<<endl;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 29 ms 2260 KB Output is correct
17 Correct 29 ms 2252 KB Output is correct
18 Correct 29 ms 2360 KB Output is correct
19 Correct 40 ms 2408 KB Output is correct
20 Correct 30 ms 2252 KB Output is correct
21 Correct 29 ms 2320 KB Output is correct
22 Correct 30 ms 2256 KB Output is correct
23 Correct 29 ms 2260 KB Output is correct
24 Correct 29 ms 2264 KB Output is correct