oj.uz

답안 #349784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
349784 2021-01-18T12:00:36 Z spike1236 Stove (JOI18_stove) C++14
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>


const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

const int MAXN = 1e5 + 10;
int n, k;
int t[MAXN];

void solve() {
    cin >> n >> k;
    multiset <int> st;
    for(int i = 1; i <= n; ++i) cin >> t[i];
    for(int i = 1; i < n; ++i) st.insert(t[i] - t[i - 1] - 1);
    ll ans = t[n] - t[1] + 1;
    for(int i = 1; i <= k; ++i) {
        ans -= *st.rbegin();
        st.erase(--st.end());
    }
    cout << ans;
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    ///cin >> T;
    while(T--) solve(), cout << '\n';
    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -