#include <stdio.h>
#define N 100000
unsigned int X = 12345;
int rand_() {
return (X *= 3) >> 1;
}
void sort(int *aa, int l, int r) {
while (l < r) {
int i = l, j = l, k = r, a = aa[l + rand_() % (r - l)], tmp;
while (j < k)
if (aa[j] == a)
j++;
else if (aa[j] < a) {
tmp = aa[i], aa[i] = aa[j], aa[j] = tmp;
i++, j++;
} else {
k--;
tmp = aa[j], aa[j] = aa[k], aa[k] = tmp;
}
sort(aa, l, i);
l = k;
}
}
int main() {
static int aa[N];
int n, k, i, ans;
scanf("%d%d", &n, &k), k = n - k;
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
for (i = n - 1; i > 0; i--)
aa[i] -= aa[i - 1] + 1;
sort(aa, 1, n);
ans = n;
for (i = 1; i <= k; i++)
ans += aa[i];
printf("%d\n", ans);
return 0;
}
Compilation message
stove.c: In function 'main':
stove.c:34:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
34 | scanf("%d%d", &n, &k), k = n - k;
| ^~~~~~~~~~~~~~~~~~~~~
stove.c:36:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
36 | scanf("%d", &aa[i]);
| ^~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
288 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
292 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
288 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
292 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 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 |
1 ms |
324 KB |
Output is correct |
| 11 |
Correct |
1 ms |
304 KB |
Output is correct |
| 12 |
Correct |
1 ms |
300 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
300 KB |
Output is correct |
| 15 |
Correct |
1 ms |
300 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
288 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
292 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 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 |
1 ms |
324 KB |
Output is correct |
| 11 |
Correct |
1 ms |
304 KB |
Output is correct |
| 12 |
Correct |
1 ms |
300 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
300 KB |
Output is correct |
| 15 |
Correct |
1 ms |
300 KB |
Output is correct |
| 16 |
Correct |
23 ms |
1608 KB |
Output is correct |
| 17 |
Correct |
24 ms |
1616 KB |
Output is correct |
| 18 |
Correct |
24 ms |
1612 KB |
Output is correct |
| 19 |
Correct |
22 ms |
1588 KB |
Output is correct |
| 20 |
Correct |
25 ms |
1524 KB |
Output is correct |
| 21 |
Correct |
21 ms |
1572 KB |
Output is correct |
| 22 |
Correct |
21 ms |
1536 KB |
Output is correct |
| 23 |
Correct |
21 ms |
1600 KB |
Output is correct |
| 24 |
Correct |
21 ms |
1612 KB |
Output is correct |
