Submission #863394

#TimeUsernameProblemLanguageResultExecution timeMemory
863394ArthasStove (JOI18_stove)C++17
100 / 100
19 ms2416 KiB
/// I'm only brave when I have to be #include <bits/stdc++.h> #define F first #define S second #define pb push_back #define ppb pop_back #define fast_io ios::sync_with_stdio(false);cin.tie(NULL); #define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout); #define FOR(i,k,n) for(int i = k; i < n; ++ i) #define debf cout<<"(0-0)\n"; #define all(x) x.begin(), x.end() #define dec(x) cout << fixed << setprecision(x); #define pf push_front #define ppf pop_front #define dash " ------- " #define what(x) cerr << #x << " is " << x << endl; #define eb emplace_back //#define int short int //#define int long long #define sz(s) (int) (s.size()) #define fl cout.flush() using namespace std; typedef long long ll; typedef pair <int, int> pii; typedef pair <int, pii> pip; typedef pair <pii, int> ppi; typedef pair <ll, ll> pll; typedef unsigned long long ull; typedef long double ld; template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >; template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >; constexpr int MOD = 1e9 + 7, N = 1e5 + 8, M = 3e5 + 8, SQ = 500, INF = 1e9 + 8, LGN = 11, mod = 998244353; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int n, k, a[N], ans; max_heap <int> pq; int32_t main(){ fast_io; cin >> n >> k; ans += k; -- k; FOR (i, 0, n){ cin >> a[i]; } ans += a[n-1] - a[0]; FOR (i, 1, n){ pq.push(a[i] - a[i-1]); } while (k){ ans -= pq.top(); pq.pop(); -- k; } cout << ans; return 0; } // Yesterday is history // Tomorrow is a mystery // but today is a gift // That is why it is called the present
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...