# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928797 | AtabayRajabli | Stove (JOI18_stove) | C++17 | 16 ms | 3316 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
// author : a1abay
// (a / b) % c = (a * b ^ (mod - 2)) % c;
#define pb push_back
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define se second
#define fi first
#define int ll
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a*b / (__gcd(a, b)))
#define mpr make_pair
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int inf = 1e9 + 7;
const int inff = 1e18 + 7;
const int sz = 2e5 + 5;
using namespace std;
void open(string s, string f)
{
freopen((s + ".txt").c_str(), "r", stdin);
freopen((f + ".txt").c_str(), "w", stdout);
}
int mod = 998244353;
int D = 69;
int n, k;
int a[sz];
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// open("in", "out");
cin >> n >> k;
for(int i = 1; i <= n; i++)
{
cin >> a[i];
}
vector<int> v;
for(int i = 2; i <= n; i++)
{
v.pb(a[i] - a[i - 1] - 1);
}
sort(all(v), greater<int>());
int ans = a[n] + 1 - a[1];
for(int i = 0; i < k -1; i++)
{
ans -= v[i];
}
cout << ans << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |