# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
785991 |
2023-07-17T21:38:26 Z |
Sputnik123 |
Stove (JOI18_stove) |
C++14 |
|
1 ms |
212 KB |
#pragma comment(linker, "/STACK:100000000")
#include <bits/stdc++.h>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define in insert
#define pll pair<ll,ll>
#define vpl vector<pll>
#define vll vector <ll>
#define vl vector<ll>
#define sl set<ll>
#define msl multiset<ll>
#define mll map<ll,ll>
#define mmll multimap<ll,ll>
#define mcl map<char,ll>
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define endl "\n"
#define speed ios_base::sync_with_stdio(false);cin.tie();cout.tie()
#define ll long long
#define ull unsigned long long
#define LMX LLONG_MAX
using namespace std;
#define REP(i, n) for (ll i=0;i<(n);i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a : x)
/*
#pragma omp parallel for
#pragma GCC optimize("0fast")
#pragma GCC target ("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
*/
bool comp(pair <ll,ll> p1,pair <ll,ll> p2)
{
if(p1.first==p2.first)
{
return p1.second>p2.second;
}
return p1.first<p2.first;
}
void solve()
{
ll n,k;
cin>>n>>k;
vll v1(n);
for(ll i=0;i<n;i++) cin>>v1[i];
priority_queue <ll> pq;
for(ll i=1;i<n;i++)
{
pq.push(v1[i]-v1[i-1]-1);
}
ll ans=0;
for(ll i=0;i<k-1;i++)
{
auto last=pq.top();
pq.pop();
ans-=last;
}
cout<<ans;
}
int main ()
{
ll t=1;
//cin>>t;
while(t--)
{
solve();
}
}
/*
string
length
*/
/*
auto locate = [&](int x) -> int {
for (int i = 0; i < N; i++)
if (P[i] == x)
return i;
return -1;
};
function in funcition
*/
Compilation message
stove.cpp:1: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
1 | #pragma comment(linker, "/STACK:100000000")
|
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |