oj.uz

Submission #266843

# Submission time Handle Problem Language Result Execution time Memory
266843 2020-08-15T13:26:47 Z shinjan Stove (JOI18_stove) C++14
100 / 100
 42 ms 2424 KB 
#include <iostream>
#include <bits/stdc++.h>
#define maxN 100001
using namespace std;
int t[maxN];
vector <int> resh;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,k;
    cin>>n>>k;
    k--;
    for(int i=0;i<n;i++)
    {
        cin>>t[i];
    }
    sort(t,t+n);
    long long ans=t[n-1]+1-t[0];
    for(int i=1;i<n;i++)
    {
        resh.push_back(t[i-1]+1-t[i]);
    }
    sort(resh.begin(),resh.end());
    int ind=0;
    while(k--)
    {
        ans+=resh[ind];
        ind++;
    }
    cout<<ans;
    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 2 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 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 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 2 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 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 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 3 ms 384 KB Output is correct
12 Correct 2 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 2 ms 384 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 2 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 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 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 3 ms 384 KB Output is correct
12 Correct 2 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 2 ms 384 KB Output is correct
16 Correct 42 ms 2424 KB Output is correct
17 Correct 26 ms 2384 KB Output is correct
18 Correct 29 ms 2340 KB Output is correct
19 Correct 22 ms 2304 KB Output is correct
20 Correct 29 ms 2304 KB Output is correct
21 Correct 23 ms 2304 KB Output is correct
22 Correct 30 ms 2344 KB Output is correct
23 Correct 29 ms 2304 KB Output is correct
24 Correct 32 ms 2304 KB Output is correct