Submission #658736

#	Time	Username	Problem	Language	Result	Execution time	Memory
658736		mariaclara	Stove (JOI18_stove)	C++17	100 / 100	55 ms	2324 KiB

stove

#include <bits/stdc++.h>
 
using namespace std;

typedef pair<int,int> pii;
const int maxn = 1e5+10;
#define pb push_back
#define f first
#define s second

int n, k, com, last, resp;
vector<pii> L;

int func(pii a, pii b) {
   return a.s - a.f > b.s - b.f;
}
int main () {
   cin >> n >> k;
   for(int i = 1; i <= n; i++) {
      int aux;
      cin >> aux;
      if(i>1) L.pb({last, aux});
      else com = aux;
      last = aux+1;
   }
   resp = last-com;
   sort(L.begin(), L.end(), func);

   for(int i = 0; i < k-1; i++)
      resp -= L[i].s - L[i].f;

   cout << resp << endl;

}

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