Submission #757909

# Submission time Handle Problem Language Result Execution time Memory
757909 2023-06-14T01:16:10 Z fdnfksd Stove (JOI18_stove) C++14
100 / 100
26 ms 3252 KB
#include <bits/stdc++.h>

using namespace std;

const string taskname = "codeforces";
#define FILE 0

#define mp make_pair
#define pb push_back
#define pf push_front
#define fi first
#define se second

#define bit(i, a) (((a)>>(i))&1)
#define ms(a, v) memset(a, v, sizeof(a))
#define lb(a, v) lower_bound(a.begin(), a.end(), v)
#define ub(a, v) upper_bound(a.begin(), a.end(), v)

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef vector<bool> vb;




const ll mod = 1e9+7;
const ll maxn = 2e5+13;
const ll inf = 1e9+5;
const ll infl = 1e18+5;
char tochar[] = {'0','1','2','3','4','5','6','7','8','9'};
const bool testcases = true;
const ll maxN=3e5+10;
ll n,a[maxN],k;
priority_queue<ll>pq;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	//freopen((taskname+".inp").c_str(), "r", stdin);
	//freopen((taskname+".out").c_str(), "w", stdout);
    cin >> n >> k;
    for(int i=1;i<=n;i++) cin >> a[i];
    ll ans=a[n]+1-a[1];
    for(int i=1;i<n;i++)
    {
        pq.push(a[i+1]-a[i]-1);
    }
    k--;
    while(k--)
    {
        ans-=pq.top();
        pq.pop();
    }
    cout << ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 21 ms 3184 KB Output is correct
17 Correct 21 ms 3148 KB Output is correct
18 Correct 15 ms 3136 KB Output is correct
19 Correct 15 ms 3180 KB Output is correct
20 Correct 19 ms 3156 KB Output is correct
21 Correct 25 ms 3216 KB Output is correct
22 Correct 26 ms 3156 KB Output is correct
23 Correct 26 ms 3252 KB Output is correct
24 Correct 25 ms 3148 KB Output is correct