Submission #251770

#TimeUsernameProblemLanguageResultExecution timeMemory
251770jamielimStove (JOI18_stove)C++14
100 / 100
37 ms2100 KiB
//#include "lost.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
const int INF=2012345678;
const ll LLINF=4012345678012345678LL;
const ll MOD=1000000007; //998244353; //
const ld PI=3.1415926535898;
const ld EPS=1e-9;
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(b==0)return a;return gcd(b,a%b);}
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
inline ll expo(ll b,ll p,ll m){ll res=1; while(p){if(p&1)res=(res*b)%m; b=(b*b)%m; p>>=1;} return res;}
inline ll modinv(ll a,ll m){return expo(a,m-2,m);}

int main(){
	int n,k;
	scanf("%d%d",&n,&k);
	int t[n];
	int d[n];d[0]=INF;
	for(int i=0;i<n;i++){
		scanf("%d",&t[i]);
		if(i>0)d[i]=t[i]-t[i-1]-1;
	}
	sort(d,d+n);reverse(d,d+n);
	int ans=t[n-1]+1-t[0];
	for(int i=1;i<k;i++){
		ans-=d[i];
	}
	printf("%d",ans);
}

Compilation message (stderr)

stove.cpp: In function 'int main()':
stove.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
  ~~~~~^~~~~~~~~~~~~~
stove.cpp:31:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&t[i]);
   ~~~~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...