# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64054 | patrikpavic2 | Stove (JOI18_stove) | C++17 | 184 ms | 14460 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cstring>
#include <set>
#define X first
using namespace std;
typedef pair < int, int> pii;
set < pii > s;
int lst = 0, n, k, fir = 0, sol = 0;
int main(){
scanf("%d%d", &n, &k);
for(int i = 0;i<n;i++){
int x;scanf("%d", &x);
if(lst)
s.insert({x - lst - 1, i});
else
fir = x;
lst = x;
}
sol = lst - fir + 1;
for(int i = 1;i<k;i++){
sol -= s.rbegin()->X;
s.erase(*s.rbegin());
}
printf("%d\n", sol);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |