제출 #198526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
198526		killB0x	Stove (JOI18_stove)	C++14	50 / 100	7 ms	632 KiB

stove

#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono; 
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> dl;
typedef vector<ii> vii;
typedef vector<dl> vdll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
#define pb push_back
#define mp make_pair
#define ft first
#define sc second
#define in insert
#define bs binary_search
#define rc(s) return cout << s,0
const ll mod=1e9+7;
const int N=100005;
#define M_PI 3.14159265358979323846
#define INF LLONG_MAX
#define sz(x) ((int)(x.size()))
#define int ll
#define endl '\n'
#define map unordered_map
/*----------------------------*/
int a[5005];
/*----------------------------*/
int32_t main() {
    //freopen("sol.in","r",stdin);
    //freopen("sol.out","w",stdout);
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i];
    multiset<int> s;
    for(int i=2;i<=n;i++)s.in(a[i]-a[i-1]-1);
    int ans=n;
    int u=n-k;
    for(auto it=s.begin();it!=s.end();it++)
    {
        if(u==0)break;
        ans+=*it;
        u--;
    }
    rc(ans);
    //THIS IS IS THE END    
}   

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 0 / 50