Submission #92114

#TimeUsernameProblemLanguageResultExecution timeMemory
92114karmaArt Exhibition (JOI18_art)C++11
100 / 100
433 ms29040 KiB
#include<bits/stdc++.h> #define For(i, a, b) for(int i = a, _b = b; i <= _b; ++i) #define Ford(i, a, b) for(int i = a, _b = b; i >= _b; --i) #define FileName "test" #define ll long long #define ld long double #define ull unsigned long #define Print(x) cerr << #x << "is " << x << '\n'; #define pb push_back #define X first #define Y second //#define Karma using namespace std; template<typename T> inline void Cin(T &x) { char c; T sign = 1; x = 0; for (c = getchar(); c < '0' || c > '9'; c = getchar()) if (c == '-') sign = -1; for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - '0'; x *= sign; } template <typename T> inline void Out(T x) {if(x > 9) Out(x / 10); putchar(x % 10 + '0');} template <typename T> inline void Cout(T x, char c) {if(x < 0) putchar('-'); x = abs(x); Out(x); putchar(c);} template <typename T, typename... Args> inline void Cin(T& a, Args&... args) {Cin(a);Cin(args...);} template <typename T, typename... Args> inline void Cout(T a, char c, Args... args) {Cout(a, c);Cout(args...);} typedef pair<int, int> pii; typedef pair<ll, int> plli; const int N = 1e6 + 7; ll n, a[N], b[N], s[N], Min, res; vector<ll> v; void Enter() { Cin(n); For(i, 1, n) Cin(a[i], b[i]), v.pb(a[i]); sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } void Solve() { For(i, 1, n) { a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin() + 1; s[a[i]] += b[i]; } Min = (ll)1e15; res = 0; for(int i = 1; i <= int(v.size()); ++i) { s[i] += s[i - 1]; Min = min(s[i - 1] - v[i - 1], Min); res = max(res, s[i] - v[i - 1] - Min); } cout << res; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifdef Karma freopen(FileName".inp", "r", stdin); freopen(FileName".out", "w", stdout); #endif // Karma Enter(); Solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...