Submission #1116836

# Submission time Handle Problem Language Result Execution time Memory
1116836 2024-11-22T13:10:17 Z vjudge1 Stove (JOI18_stove) C++14
100 / 100
21 ms 2868 KB
#include <bits/stdc++.h>
#define sts(v) stable_sort(v.BE, v.E)
#define Rsts(v) stable_sort(v.rBE, v.rE)
#define rev(v) reverse(v.BE, v.E)
#define BE begin()
#define rBE rbegin()
#define E end()
#define rE rend()
#define pb push_back
#define ppb pop_back()
#define pf push_front
#define ppf pop_front()
#define F first
#define S second

using namespace std;
using ll = long long;

int main(){
    ios_base::sync_with_stdio(0); 
    cin.tie(0); cout.tie(0);

    int n, k; cin >> n >> k;
    vector<int> v(n);

    for(int &i : v)cin >> i;

    sts(v);

    ll ans = n;
    priority_queue<int> q;
    k--;

    for(int i = 1; i < n; i++)
        q.push(v[i] - v[i - 1]);
    
    while(k-- && q.size())
        q.pop();

    while(q.size()){
        ans += q.top() - 1;
        q.pop();
    }

    cout << ans << '\n';
    
	
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 508 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 508 KB Output is correct
16 Correct 19 ms 2700 KB Output is correct
17 Correct 19 ms 2700 KB Output is correct
18 Correct 19 ms 2700 KB Output is correct
19 Correct 20 ms 2700 KB Output is correct
20 Correct 21 ms 2868 KB Output is correct
21 Correct 19 ms 2576 KB Output is correct
22 Correct 20 ms 2700 KB Output is correct
23 Correct 19 ms 2700 KB Output is correct
24 Correct 19 ms 2700 KB Output is correct