Submission #648185

# Submission time Handle Problem Language Result Execution time Memory
648185 2022-10-05T16:33:25 Z antete Stove (JOI18_stove) C++14
100 / 100
62 ms 1312 KB
#include <bits/stdc++.h>
#define fi first
#define se second
#define wii(x) cout << #x << " = " << x << endl;

typedef long long ll;
using namespace std;

priority_queue<int> q;

int main()
{
    int n, k;
    cin >> n >> k;
    int t[n];
    for(int i = 0; i < n; i++)
    {
        cin >> t[i];
    }
    sort(t, t + n);
    int c = t[n - 1] - t[0] + 1;
    for(int i = 0; i < n - 1; i++)
    {
        q.push(t[i + 1] - t[i] - 1);
    }
    for(int i = 0; i < k - 1; i++)
    {
        c -= q.top();
        q.pop();
    }
    cout << c;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 2 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 2 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 43 ms 1296 KB Output is correct
17 Correct 41 ms 1312 KB Output is correct
18 Correct 42 ms 1312 KB Output is correct
19 Correct 43 ms 1296 KB Output is correct
20 Correct 48 ms 1232 KB Output is correct
21 Correct 62 ms 1308 KB Output is correct
22 Correct 56 ms 1312 KB Output is correct
23 Correct 54 ms 1296 KB Output is correct
24 Correct 51 ms 1204 KB Output is correct