oj.uz

Submission #504966

# Submission time Handle Problem Language Result Execution time Memory
504966 2022-01-10T11:04:34 Z Andy__Andy__ Stove (JOI18_stove) C++17
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
#define ll long long
//#define int ll
using namespace std;

ifstream f ("test.in");
ofstream g ("test.out");

priority_queue < int > q;

int main()
{
    int n,k;
    cin>>n>>k;

    vector < int > v(n+5);

    for(int i=1;i<=n;++i)
    {
        cin>>v[i];
    }

    if(n == k)
    {
        cout<<n;
        return 0;
    }

    for(int i=1;i<n;++i)
    {   cout<<v[i+1]-v[i]-1<<'\n';
        q.push( (v[i+1]-v[i]-1) );
    }

    int ans = v[n]-v[1]+1;
    k--;
    while(k--)
    {
        int x = q.top();
        cout<<x<< '\n';
        ans -=x;
        q.pop();
    }

    cout<<ans;

    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -