제출 #1279766

#제출 시각아이디문제언어결과실행 시간메모리
1279766SSKMFStove (JOI18_stove)C++20
100 / 100
18 ms968 KiB
#include <bits/stdc++.h> using namespace std; priority_queue <int> candidati; int main () { ios :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int lungime , limita , anterior; cin >> lungime >> limita >> anterior; int rezultat = 1; for (int indice = 2 , actual ; indice <= lungime ; indice++ , anterior = actual) { cin >> actual; candidati.push(actual - anterior - 1); rezultat += actual - anterior; } while (--limita) { rezultat -= candidati.top(); candidati.pop(); } cout << rezultat; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...