oj.uz

Submission #701035

# Submission time Handle Problem Language Result Execution time Memory
701035 2023-02-19T20:34:02 Z mychecksedad Stove (JOI18_stove) C++17
100 / 100
 28 ms 2076 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 1e6+100, M = 1e5+10, K = 20;


int n, k, t[N], a[N];
void solve(){
  cin >> n >> k;
  for(int i = 0; i < n; ++i) cin >> t[i];
  sort(t, t + n);
  for(int i = 0; i < n - 1; ++i) a[i] = t[i + 1] - t[i];
  sort(a, a + n - 1, greater<int>());
  int ans = t[n - 1] - t[0] + 1;
  for(int i = 0; i < k - 1; ++i){
    ans -= a[i] - 1;
  }
  cout << ans;
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int T = 1, aa;
  // cin >> T;aa=T;
  while(T--){
    // cout << "Case #" << aa-T << ": ";
    solve();
    cout << '\n';
  }
  return 0;
 
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:30:14: warning: unused variable 'aa' [-Wunused-variable]
   30 |   int T = 1, aa;
      |              ^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 428 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 428 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 28 ms 2004 KB Output is correct
17 Correct 26 ms 2032 KB Output is correct
18 Correct 19 ms 2060 KB Output is correct
19 Correct 18 ms 2076 KB Output is correct
20 Correct 18 ms 2028 KB Output is correct
21 Correct 22 ms 2016 KB Output is correct
22 Correct 19 ms 2032 KB Output is correct
23 Correct 19 ms 2012 KB Output is correct
24 Correct 20 ms 2072 KB Output is correct