Submission #686693

#	Time	Username	Problem	Language	Result	Execution time	Memory
686693		thegamercoder19	Art Exhibition (JOI18_art)	C++14	0 / 100	1 ms	212 KiB

art

/*
Coded by thegamercoder19
GL
*/
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>

#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ull MAX = 1e5 + 1;
const ll MODD = 998244353;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout << (s ? "YES" : "NO") << endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
ll n, res,s, ama, ami, res1;
V<pll> a;
bool cmp(const pll & a, const pll & b)
{
    if (a.first == b.first)return a.second > b.second;
    return a.first < b.first;
}
void solve() {
    cin >> n;
    a.resize(n);
    FOR(ll, i, 0, n, 1)cin >> a[i].first >> a[i].second;
    sort(all(a), cmp);
    res = 0;
    FOR(ll, i, 0, 1, 1)
    {
        ami = INFL, ama = 0, s = 0, res1=0;
        FOR(ll, j, i, n, 1)
        {
            ami = min(ami, a[j].first), ama = max(ama, a[j].first), s += a[j].second;
            //if (s - ama + ami < res1)break;
            res1 = max(res1,s - ama + ami);
        }
        res = max(res, res1);
    }
    cout << res << endl;

}
void init()
{


}
void handle()
{
    init();
    ll t = 1;
    if (TYP)cin >> t;
    //getline(cin, s);
    WHI(t)solve();
}

int main()
{
    IOF
        handle();
    RET 0;
}

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