Submission #366008

# Submission time Handle Problem Language Result Execution time Memory
366008 2021-02-12T17:49:32 Z Hades504 Stove (JOI18_stove) C++17
100 / 100
31 ms 3708 KB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
void solve(){
  int tc,k;
  cin>>tc>>k;
  k--;
  vector<int>v,diff;
  for(int i=0;i<tc;i++){
    int n;
    cin>>n;
    v.push_back(n);
    v.push_back(n+1);
  }
  int ans=0;
  ans+=tc;
  auto st = v.begin();
  v.erase(st);
  auto end = v.end();
  end--;
  v.erase(end);
  for(int i=0;i<v.size();i+=2){
    diff.push_back(v[i+1]-v[i]);
  }
  sort(diff.rbegin(),diff.rend());
  for(int i=k;i<diff.size();i++){
    ans+=diff[i];
  }
  cout<<ans;
}
signed main() {
  ios_base::sync_with_stdio(false); cin.tie(NULL);
  int tc=1;
  for(int i=0;i<tc;i++)solve();
  return 0;
}

Compilation message

stove.cpp: In function 'void solve()':
stove.cpp:23:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |   for(int i=0;i<v.size();i+=2){
      |               ~^~~~~~~~~
stove.cpp:27:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   for(int i=k;i<diff.size();i++){
      |               ~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 25 ms 3684 KB Output is correct
17 Correct 23 ms 3708 KB Output is correct
18 Correct 31 ms 3684 KB Output is correct
19 Correct 24 ms 3684 KB Output is correct
20 Correct 24 ms 3684 KB Output is correct
21 Correct 24 ms 3684 KB Output is correct
22 Correct 24 ms 3684 KB Output is correct
23 Correct 23 ms 3684 KB Output is correct
24 Correct 26 ms 3684 KB Output is correct