Submission #1216541

#TimeUsernameProblemLanguageResultExecution timeMemory
1216541olartgaboStove (JOI18_stove)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h> using namespace std; #define dbg(x) cerr << #x << " = " << (x) << endl; #define Yes cout <<"Yes"<<"\n"; #define No cout <<"No"<<"\n"; using ll = long long; int main(){ ios::sync_with_stdio(false); cin.tie(NULL); int n,k; cin>>n>>k; vector<int>list(n); for(int i=0;i<n;i++){ cin>>list[i]; } int res=n; //3 4 vector<int> huec; for (int i =1;i<n;i++) { int hueco=list[i]-(list[i-1]+1);//3-2 6-4 //dbg(hueco) huec.push_back(hueco); } sort(list.begin(), list.end()); int conj = n-k;//lapsos, grupos que puedo formar for (int i =0;i<conj;i++) { res += list[i]; //todo lo que pueda en consumo } cout<<res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...