제출 #1278092

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

art

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18 + 7;
const int MOD = 1000000007;
const int MOD1 = 998244353;
const int MOD2 = 1e9 + 9;
const int MAXXX = 1e3 + 5;
const int MAXXXx = 1e3 + 5;
const int OFFSET = 200;
void Make_set(vector<int>& v)
{
    set<int> s(v.begin(), v.end());
    v.assign(s.begin(), s.end());
}
int Pow(int n, int k, int mod) 
{
    int res = 1;
    while (k > 0) 
    {
        if (k % 2 == 1) 
        {
            res = (res * n) % mod;
        }
        n = (n * n) % mod;
        k /= 2;
    }
    return res;
}
vector<pair<int, vector<int>>> dp(MAXXX);
int x[MAXXX];
signed main() 
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T ;
    // cin >> T;
    T = 1;
    for (int K = 0; K < T; K++)
    {
        int n;
        cin >> n;
        int a[n], b[n];
        for(int i = 0; i < n; i++) cin >> a[i] >> b[i];
        int pr[n], ans = 0, mn = 0;
        sort(a, a + n);
        pr[0] = a[0];
        for(int i = 1; i < n; i++)
        {
            pr[i] = pr[i - 1] + a[i];
        }
        for(int r = 0; r < n; r++)
        {
            ans = max(ans , pr[r] - a[r] - mn);
            mn = min(mn, pr[r] - a[r]);
        }
        cout << ans;
        
    }
    return 0;
}

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