제출 #1196943

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1196943		amanthaband	Art Exhibition (JOI18_art)	C++20	0 / 100	0 ms	320 KiB

art

#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;


using ll = long long;
ll mod = 100000000000000000007;

ll modpow(ll a, ll b) {
    ll result = 1;
    a %= mod;
    while (b > 0) {
        if (b % 2 == 1)
            result = (result * a) % mod;
        a = (a * a) % mod;
        b /= 2;
    }
    return result;
}

ll solve(ll n,vector<pair<ll,ll>> arr){
    ll mx = -10;
    
    if(n == 2){
        ll s = 0;
        ll m = -10;
        ll mn = mod;
        for(const auto& num : arr){
            s+= num.second;
            m = max(m,num.first);
            mn = min(mn,num.first);
        }
        return s - (m - mn);
    }
    ll mnn = mod;
    ll ans = 0;
    ll h = 0;
    for(const auto& num : arr){
        h += num.second;
        mx = max(mx,num.first);
        mnn = min(mnn,num.first);

        ans = max(ans,h - (mx - mnn));
    }
    
    
    return ans;
}


int main() {
    ll n;
    cin>>n;

    vector<pair<ll,ll>> vec(n);

    for (int i = 0; i < n; i++)
    {
        ll k,m;
        cin>>k>>m;
        vec[i] = {k, m};
    }
    
    sort(vec.begin(),vec.end());
    ll ans = solve(n,vec);
    cout<<ans<<endl;
    

    return 0;
}

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

art.cpp:11:10: warning: integer constant is too large for its type
   11 | ll mod = 100000000000000000007;
      |          ^~~~~~~~~~~~~~~~~~~~~

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