oj.uz

Submission #331083

# Submission time Handle Problem Language Result Execution time Memory
331083 2020-11-27T09:02:10 Z ItzMeOwww Stove (JOI18_stove) C++14
100 / 100
 158 ms 1896 KB 
#include <bits/stdc++.h>
using namespace std;
priority_queue<int>pq;
int main(){
    int n,t;
    long long ans = 0;
    int bx,x;
    scanf(" %d %d",&n,&t);
    scanf(" %d",&bx);
    for(int i = 2;i<=n;i++){
        scanf(" %d",&x);
        pq.push(x - bx);
        bx = x;
    }
    long long add = 0;
    t--;
    ans++;
    while(t-- && !pq.empty()){
        ans++;
        pq.pop();
    }
    while(!pq.empty()){
        ans += pq.top();
        pq.pop();
    }
    cout << ans;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:15:15: warning: unused variable 'add' [-Wunused-variable]
   15 |     long long add = 0;
      |               ^~~
stove.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    8 |     scanf(" %d %d",&n,&t);
      |     ~~~~~^~~~~~~~~~~~~~~~
stove.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 |     scanf(" %d",&bx);
      |     ~~~~~^~~~~~~~~~~
stove.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 |         scanf(" %d",&x);
      |         ~~~~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 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 1 ms 364 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 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 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 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 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 33 ms 1896 KB Output is correct
17 Correct 92 ms 1768 KB Output is correct
18 Correct 35 ms 1768 KB Output is correct
19 Correct 158 ms 1896 KB Output is correct
20 Correct 130 ms 1816 KB Output is correct
21 Correct 30 ms 1768 KB Output is correct
22 Correct 31 ms 1768 KB Output is correct
23 Correct 31 ms 1768 KB Output is correct
24 Correct 30 ms 1768 KB Output is correct