Submission #176085

#TimeUsernameProblemLanguageResultExecution timeMemory
176085awlintqaaStove (JOI18_stove)C++14
100 / 100
85 ms3308 KiB
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0) #include <bits/stdc++.h> using namespace std; #define sqr 500 #define mid (l+r)/2 #define pb push_back #define ppb pop_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define ins insert #define era erase #define C continue #define mem(dp,i) memset(dp,i,sizeof(dp)) #define mset multiset typedef long long ll; typedef long double ld; typedef pair<int,int> pi; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; const ll mod=1000000007;//998244353; const ll inf=1e18*4; const ld pai=acos(-1); ll n,k; ll a[100009]; int main(){ cin>>n>>k; for(int i=0;i<n;i++)cin>>a[i]; vll v; ll sum=1; for(int i=1;i<n;i++)v.pb(a[i]-a[i-1]),sum+=a[i]-a[i-1]; sort(v.begin(),v.end()); k--; ll j=v.size()-1; while(k--){ sum-=v[j--]-1; } cout<<sum<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...