# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28445 | 맞왜틀 맞왜틀 신나는노래~ 헤이! 나도한번 불러보자 (#68) | 포도주 시음 (FXCUP2_wine) | C++11 | 0 ms | 1932 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
#include <vector>
int main(){
int N,K;
scanf("%d%d",&N,&K);
std::vector<int> D(N+1);
std::vector<int> ans;
int mval = 0;
for(int i =1 ; i <= N; i++){
scanf("%d",&D[i]);
}
std::vector<int> plus,minus;
for(int i = 0; i <= N ;){
int s = i;
while(i+1 <= N && D[i] <= D[i+1]) i++;
if(s != i){
plus.push_back(D[i]-D[s]);
if(ans.size() != 0) minus.push_back(D[s]-ans.back());
ans.push_back(D[s]);
ans.push_back(D[i]);
}
i++;
}
long long tot = 0;
std::sort(minus.begin(),minus.end());
for(auto i : plus){
tot += i;
}
int pused = plus.size()*2-1;
while(pused > K){
pused-=2;
tot+=minus.back();
minus.pop_back();
}
printf("%lld",tot);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |