제출 #128942

#제출 시각아이디문제언어결과실행 시간메모리
128942PlurmCake 3 (JOI19_cake3)C++11
0 / 100
2 ms360 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n,m; scanf("%d%d",&n,&m); int v,c; vector<pair<int,int> > pieces; for(int i = 0; i < n; i++){ scanf("%d%d",&v,&c); pieces.emplace_back(v,c); } sort(pieces.begin(), pieces.end(), [](pair<int,int> x, pair<int,int> y){ return x.second < y.second; }); set<pair<pair<int,int>,int> > s; long long ans = -1e18; long long cur = 0ll; for(int i = 0; i < m; i++){ s.insert(make_pair(pieces[i],i)); cur += 1ll * pieces[i].first; } cur -= 2ll * pieces[m-1].second; cur += 2ll * pieces[0].second; int l = 0; int r = m-1; for(int i = m; i < n; i++){ // Case 1: Remove min long long test1 = cur; test1 -= 1ll * s.begin()->first.first; test1 += 1ll * pieces[i].first; test1 += 2ll * pieces[r].second; test1 -= 2ll * pieces[i].second; // Case 2: Remove left long long test2 = cur; int newl = l+1; while(!s.count(make_pair(pieces[newl],newl))) newl++; test2 -= 1ll * pieces[l].first; test2 += 1ll * pieces[i].first; test2 += 2ll * pieces[r].second; test2 -= 2ll * pieces[i].second; test2 -= 2ll * pieces[l].second; test2 += 2ll * pieces[newl].second; // Case 3: Do nothing long long test3 = cur; long long best = max(max(test1, test2), test3); if(test2 == best){ s.erase(make_pair(pieces[l],l)); s.insert(make_pair(pieces[i],i)); l = newl; r = i; }else if(test1 == best){ s.erase(s.begin()); s.insert(make_pair(pieces[i],i)); r = i; } cur = best; ans = max(ans, cur); } printf("%lld\n",ans); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

cake3.cpp: In function 'int main()':
cake3.cpp:5:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
cake3.cpp:9:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&v,&c);
         ~~~~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...