Submission #66720

# Submission time Handle Problem Language Result Execution time Memory
66720 2018-08-12T07:29:10 Z ekrem Stove (JOI18_stove) C++
100 / 100
42 ms 2168 KB
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 1000005
using namespace std;
typedef long long ll;
ll n, m, ind, say, ans, x, a[N], b[N];

int main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	scanf("%lld %lld",&n ,&m);
	for(ll i = 1; i <= n; i++)
		scanf("%lld",a + i);
	sort(a + 1, a + n + 1);
	a[0] = -1;
	for(ll i = 1; i <= n; i++)
		if(a[i - 1] < a[i] - 1){
			if(i != 1)
				b[++ind] = a[i] - a[i - 1] - 1;
			say++;
		}
	// cout << say << " " << m << endl;
	if(say <= m){
		printf("%lld\n",n);
		return 0;
	}
	ans = n;
	sort(b + 1, b + ind + 1);
	for(; m < say and x <= ind; m++){
		ans += b[++x];
		// cout << "AMK" << b[x] << endl;
	}
	printf("%lld\n",ans);
	return 0;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:14:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld",&n ,&m);
  ~~~~~^~~~~~~~~~~~~~~~~~~~
stove.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",a + i);
   ~~~~~^~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 2 ms 568 KB Output is correct
9 Correct 2 ms 688 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 2 ms 568 KB Output is correct
9 Correct 2 ms 688 KB Output is correct
10 Correct 4 ms 688 KB Output is correct
11 Correct 4 ms 688 KB Output is correct
12 Correct 3 ms 688 KB Output is correct
13 Correct 3 ms 688 KB Output is correct
14 Correct 3 ms 688 KB Output is correct
15 Correct 3 ms 688 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 2 ms 568 KB Output is correct
9 Correct 2 ms 688 KB Output is correct
10 Correct 4 ms 688 KB Output is correct
11 Correct 4 ms 688 KB Output is correct
12 Correct 3 ms 688 KB Output is correct
13 Correct 3 ms 688 KB Output is correct
14 Correct 3 ms 688 KB Output is correct
15 Correct 3 ms 688 KB Output is correct
16 Correct 33 ms 2168 KB Output is correct
17 Correct 33 ms 2168 KB Output is correct
18 Correct 33 ms 2168 KB Output is correct
19 Correct 32 ms 2168 KB Output is correct
20 Correct 38 ms 2168 KB Output is correct
21 Correct 42 ms 2168 KB Output is correct
22 Correct 35 ms 2168 KB Output is correct
23 Correct 33 ms 2168 KB Output is correct
24 Correct 30 ms 2168 KB Output is correct