Submission #713163

#TimeUsernameProblemLanguageResultExecution timeMemory
713163ln_eStove (JOI18_stove)C++17
100 / 100
27 ms3224 KiB
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho using ll=long long; using ld=long double; int const INF=1000000005; ll const LINF=1000000000000000005; ll const mod=1000000007; ld const PI=3.14159265359; ll const MAX_N=3e5+5; ld const EPS=0.00000001; #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define f first #define s second #define pb push_back #define mp make_pair #define endl '\n' #define sz(a) (int)a.size() #define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; ll n,k,a[100005]; int32_t main(){ CODE_START; #ifdef LOCAL ifstream cin("input.txt"); #endif cin>>n>>k; for(ll i=1;i<=n;i++) { cin>>a[i]; } if(n==k){ cout<<n<<endl; return 0; } vector<ll>v; for(ll i=2;i<=n;i++) { v.pb(a[i]-a[i-1]); } ll ans=0; sort(v.begin(),v.end()); for(ll i=0;i<n-k;i++) { ans+=v[i]; } ans+=k; cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...