제출 #768687

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
768687		LinkedArray	Art Exhibition (JOI18_art)	C++17	100 / 100	151 ms	20796 KiB

art

#include <bits/stdc++.h>
using namespace std;
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    long long n;
    
    cin >> n;
    pair<long long, long long> artwork[n + 1];
    for(long long i = 1; i <= n; i++){
        cin >> artwork[i].first >> artwork[i].second;
        // First = Size; Second = Value;
    }
    sort(artwork, artwork + n + 1); // Sort the vector
    long long ans = 0, totalValue = 0, restTillLastTotalValue = 0;
    for(long long i = 1; i <= n; i++){
        // Keep the current value sum
        // We also keep a variable restTillLastTotalValue (size - lastSum(lastSum which can be written as currentSum - currentValue));
        ans = max(ans, (totalValue = totalValue + artwork[i].second) - (artwork[i].first - (restTillLastTotalValue = max(restTillLastTotalValue, artwork[i].first - (totalValue - artwork[i].second)))));
    }
    cout << ans;
	return 0;
}

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

art.cpp: In function 'int main()':
art.cpp:21:36: warning: operation on 'totalValue' may be undefined [-Wsequence-point]
   21 |         ans = max(ans, (totalValue = totalValue + artwork[i].second) - (artwork[i].first - (restTillLastTotalValue = max(restTillLastTotalValue, artwork[i].first - (totalValue - artwork[i].second)))));
      |                        ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50