Submission #1133330

#TimeUsernameProblemLanguageResultExecution timeMemory
1133330MunkhturErdenebatStove (JOI18_stove)C++20
100 / 100
30 ms1928 KiB
#include<bits/stdc++.h> #include<string.h> #include <algorithm> #include <stdlib.h> #define ll long long using namespace std; ll a,b,c,d,e,f,m,i,j,n,h,g,l,r,ka,p,q,t[500005], k[500005]; map<ll,ll> maa,mii,mee; vector<ll> vj,vo,vi; int main(){ cin>>a>>b; for(i=0 ; i<a ; i++){ cin>>t[i]; } b--; g=t[a-1]-t[0]; q=g+1; for(i=1 ; i<a ; i++){ k[i]=t[i]-t[i-1]-1; } sort(k+1,k+a); g=0; for(i=a-1 ; i>=max(p+1,a-b) ; i--){ g+=k[i]; } cout<<q-g<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...