Submission #499304

# Submission time Handle Problem Language Result Execution time Memory
499304 2021-12-27T22:54:02 Z Marceantasy Stove (JOI18_stove) C++17
100 / 100
22 ms 2316 KB
#include <bits/stdc++.h>
using namespace std; 

#define ll long long
#define ar array

const int mxN = 2e5+1, M = 1e9+7; 

int main(){
#ifdef _DEBUG
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
    std::ios_base::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0);
    
    int n, k; 
    cin >> n >> k, --k; 
    vector<int> a(n), flag; 
    int ans = n;
    for(int i = 0; i<n; ++i){
        cin >> a[i];
    }
    for(int i = 1; i<n; ++i){
        flag.push_back(a[i]-a[i-1]-1);
    }
    sort(flag.rbegin(), flag.rend()); 
    for(int i = k; i<flag.size(); ++i){
        ans += flag[i];
    }
    cout << ans << "\n";
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:27:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i = k; i<flag.size(); ++i){
      |                    ~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 356 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 356 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 22 ms 2236 KB Output is correct
17 Correct 18 ms 2220 KB Output is correct
18 Correct 17 ms 2236 KB Output is correct
19 Correct 19 ms 2316 KB Output is correct
20 Correct 17 ms 2244 KB Output is correct
21 Correct 18 ms 2252 KB Output is correct
22 Correct 17 ms 2308 KB Output is correct
23 Correct 17 ms 2248 KB Output is correct
24 Correct 17 ms 2304 KB Output is correct