oj.uz

Submission #91257

# Submission time Handle Problem Language Result Execution time Memory
91257 2018-12-26T18:05:22 Z Alisabzi Stove (JOI18_stove) C++14
100 / 100
 23 ms 10280 KB 
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
#define F first 
#define S second
const ll N = 100411 ;
vector < int > a ; 
int n, k, b, x;
int main ()
{
	scanf("%d%d", &n, &k) ;
	scanf("%d", &b) ;
	for(int i = 2 ; i <= n ; i ++){
		scanf("%d", &x) ;
		a.push_back(x-b) ;
		b = x ; 
	}
	if(n == 1)
		return cout << 1 , 0 ;
	sort(a.begin(), a.end()) ;
	ll ans = n ;
	for(int i = 0 ; i < n-k ; i ++){
		ans += a[i]-1 ;
	}
	cout << ans ;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &k) ;
  ~~~~~^~~~~~~~~~~~~~~~
stove.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &b) ;
  ~~~~~^~~~~~~~~~
stove.cpp:14:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &x) ;
   ~~~~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 420 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
3 Correct 2 ms 580 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 804 KB Output is correct
6 Correct 2 ms 828 KB Output is correct
7 Correct 2 ms 828 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 2 ms 828 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 420 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
3 Correct 2 ms 580 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 804 KB Output is correct
6 Correct 2 ms 828 KB Output is correct
7 Correct 2 ms 828 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 2 ms 828 KB Output is correct
10 Correct 3 ms 864 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 3 ms 944 KB Output is correct
13 Correct 2 ms 992 KB Output is correct
14 Correct 2 ms 1040 KB Output is correct
15 Correct 2 ms 1148 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 420 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
3 Correct 2 ms 580 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 804 KB Output is correct
6 Correct 2 ms 828 KB Output is correct
7 Correct 2 ms 828 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 2 ms 828 KB Output is correct
10 Correct 3 ms 864 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 3 ms 944 KB Output is correct
13 Correct 2 ms 992 KB Output is correct
14 Correct 2 ms 1040 KB Output is correct
15 Correct 2 ms 1148 KB Output is correct
16 Correct 23 ms 2524 KB Output is correct
17 Correct 23 ms 3536 KB Output is correct
18 Correct 23 ms 4452 KB Output is correct
19 Correct 23 ms 5412 KB Output is correct
20 Correct 23 ms 6380 KB Output is correct
21 Correct 23 ms 7344 KB Output is correct
22 Correct 23 ms 8452 KB Output is correct
23 Correct 23 ms 9272 KB Output is correct
24 Correct 23 ms 10280 KB Output is correct