oj.uz

Submission #256503

# Submission time Handle Problem Language Result Execution time Memory
256503 2020-08-02T19:01:17 Z iliccmarko Stove (JOI18_stove) C++14
100 / 100
 43 ms 2552 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int n, k;
vector<int> t;
vector<int> raz;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>k;
    for(int i = 1;i<=n;i++)
    {
        int a;
        cin>>a;
        t.push_back(a);
    }
    sort(t.begin(),t.end());
    for(int i = 1;i<(int)t.size();i++)
    {
        raz.push_back(t[i]-t[i-1]-1);
    }
    sort(raz.begin(),raz.end(),greater<int>());
    int sum = 0;
    for(int i = 0;i<k-1;i++)
        sum+=raz[i];
    cout<<t[n-1] - t[0] + 1 - sum;




    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 1 ms 416 KB Output is correct
16 Correct 27 ms 2428 KB Output is correct
17 Correct 43 ms 2420 KB Output is correct
18 Correct 24 ms 2420 KB Output is correct
19 Correct 25 ms 2428 KB Output is correct
20 Correct 42 ms 2428 KB Output is correct
21 Correct 35 ms 2428 KB Output is correct
22 Correct 25 ms 2428 KB Output is correct
23 Correct 29 ms 2420 KB Output is correct
24 Correct 33 ms 2552 KB Output is correct