oj.uz

답안 #958917

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958917 2024-04-07T05:30:07 Z vjudge1 Stove (JOI18_stove) C++14
20 / 100
 2 ms 2648 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define nl '\n'
#define deb(x) cout << #x << ": " << x << nl;
ll ps[1<<18];
ll arr[1<<18];

void solve()
{
    ll n, k; cin >> n >> k;
    for (ll i = 1; i <= n; i++)
    {
        cin >> arr[i];
    }
    sort(arr+1, 1+arr+n);
    for (ll i = 1; i <= n; i++)
        ps[i] = -arr[i] + arr[i-1];
        
    sort (ps+1, ps+1+n);
    ll suma = arr[n]+1 - arr[1];
    //deb(suma);
    for (ll i = 1; i < k; i++)
    {
        //deb(ps[i]-1);
        suma += ps[i]+1;
    }
    cout << suma << nl;
}
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    ll t = 1; //cin >> t;
    while (t--)
        solve();
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2552 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2552 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 2 ms 2396 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2552 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 2 ms 2396 KB Output isn't correct
13 Halted 0 ms 0 KB -