oj.uz

Submission #168039

# Submission time Handle Problem Language Result Execution time Memory
168039 2019-12-11T07:46:55 Z partha2002 Stove (JOI18_stove) C++14
100 / 100
 84 ms 2136 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,e) for(int i=o;i<e;i++)
int main()
{
  int n,k;
  cin>>n>>k;
  int t[n];
  FOR(i,0,n)
  {
    cin>>t[i];
  }
  int df[n-1];
  FOR(i,0,n-1)
  {
    df[i]=t[i+1]-t[i];
  }
  sort(df,df+(n-1));
  long long int s=0;
  FOR(i,0,n-k)
  {
    s+=df[i];
  }
  s+=k;
  cout<<s<<endl;
  return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 396 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 352 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 368 KB Output is correct
9 Correct 2 ms 256 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 396 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 352 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 368 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 4 ms 296 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 408 KB Output is correct
15 Correct 4 ms 376 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 396 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 352 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 368 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 4 ms 296 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 408 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 82 ms 2052 KB Output is correct
17 Correct 84 ms 2112 KB Output is correct
18 Correct 83 ms 2080 KB Output is correct
19 Correct 83 ms 1984 KB Output is correct
20 Correct 83 ms 2056 KB Output is correct
21 Correct 84 ms 2032 KB Output is correct
22 Correct 82 ms 2040 KB Output is correct
23 Correct 82 ms 2040 KB Output is correct
24 Correct 83 ms 2136 KB Output is correct