oj.uz

Submission #334195

# Submission time Handle Problem Language Result Execution time Memory
334195 2020-12-08T15:34:58 Z shahriarkhan Stove (JOI18_stove) C++14
100 / 100
 25 ms 2408 KB 
#include<bits/stdc++.h>
using namespace std ;

const int INF = 1e9 ;

int main()
{
    int n , k ;
    scanf("%d%d",&n,&k) ;
    int a[n+1] ;
    for(int i = 1 ; i <= n ; ++i) scanf("%d",&a[i]) ;
    sort(a+1,a+n+1) ;
    vector<int> v ;
    int tot = a[n] - a[1] + 1 ;
    for(int i = 1 ; i < n ; ++i)
    {
        v.push_back(a[i]-a[i+1]+1) ;
    }
    sort(v.begin(),v.end()) ;
    for(int i = 0 ; i < (k-1) ; ++i) tot += v[i] ;
    printf("%d\n",tot) ;
    return 0 ;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 |     scanf("%d%d",&n,&k) ;
      |     ~~~~~^~~~~~~~~~~~~~
stove.cpp:11:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 |     for(int i = 1 ; i <= n ; ++i) scanf("%d",&a[i]) ;
      |                                   ~~~~~^~~~~~~~~~~~

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 1 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 1 ms 364 KB Output is correct
16 Correct 24 ms 2280 KB Output is correct
17 Correct 24 ms 2280 KB Output is correct
18 Correct 24 ms 2280 KB Output is correct
19 Correct 25 ms 2408 KB Output is correct
20 Correct 25 ms 2280 KB Output is correct
21 Correct 25 ms 2280 KB Output is correct
22 Correct 25 ms 2280 KB Output is correct
23 Correct 24 ms 2280 KB Output is correct
24 Correct 24 ms 2280 KB Output is correct