제출 #586545

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
586545		TheEvilBird	Art Exhibition (JOI18_art)	C++17	10 / 100	5 ms	328 KiB

art

#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <numeric>
#include <string>
#include <bitset>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <random>
#include <ctime>
#include <chrono>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)((x).size())

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
//typedef __int128_t int128;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const char en = '\n';
const int INF = 1e9 + 7;
const ll INFLL = 1e18;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

void solve() {
    int n;
    cin >> n;
    vector<pll> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i].first >> a[i].second;
    }
    sort(all(a));
    ll ans = a[0].second, now = a[0].first + a[0].second;
    for (int i = 1; i < n; ++i) {
        now += a[i].second;
        now -= a[i].first;
        ans = max(ans, now);
        now += a[i].first;
    }
    cout << ans << en;
}

void stupid() {
    int n;
    cin >> n;
    vector<pll> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i].first >> a[i].second;
    }
    ll ans = 0;
    for (int mask = 1; mask < (1 << n); ++mask) {
        ll now = 0, mn = INFLL, mx = -INFLL;
        for (int i = 0; i < n; ++i) {
            if (mask & (1 << i)) {
                mn = min(mn, a[i].first);
                mx = max(mx, a[i].first);
                now += a[i].second;
            }
        }
        ans = max(ans, now + mn - mx);
    }
    cout << ans << en;
}

int main() {
#ifdef __APPLE__
    freopen("input.txt", "r", stdin);
#else
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif
//    solve();
    stupid();
    return 0;
}

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