Submission #966094

# Submission time Handle Problem Language Result Execution time Memory
966094 2024-04-19T11:24:59 Z MercubytheFirst Art Exhibition (JOI18_art) C++17
100 / 100
267 ms 68204 KB
#include <bits/stdc++.h>
using ll = long long;
#define pb push_back
using namespace std;
#define CDIV(a, b) ((((a) - (1)) / (b)) + 1)
const ll inf = 1e9 + 37;



template<typename T, size_t N>
std::ostream& operator<<(std::ostream& os, const std::array<T, N>& a);
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v);
template<typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p);
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& s);
template<typename T, typename cmp>
std::ostream& operator<<(std::ostream& os, const std::set<T, cmp>& s);

// using __int128_t = long long;

void solve() { 
  ll tempn;
  cin >> tempn;
  __int128_t n = tempn;
  vector<pair<__int128_t, __int128_t> > v(n + 1);
  vector<__int128_t> pref(n + 1);
  for(__int128_t i = 1; i <= n; ++i) {
    ll a, b;
    cin >> a >> b;
    v[i] = {a, b};
  }
  sort(v.begin() + 1, v.end());
  for(__int128_t i = 1; i <= n; ++i){
    pref[i] = pref[i - 1] + v[i].second;
  }
  // cout << v << endl << pref << endl;
  set<__int128_t> s;
  __int128_t ans = 0;
  for(__int128_t i = 1; i <= n; ++i) {
    s.insert(v[i].first - pref[i - 1]);
    ans = max(ans, pref[i] - v[i].first + *s.rbegin());
  }
  cout << (ll)ans << endl;
}

signed main() {
  // #ifndef ONLINE_JUDGE
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  // #endif
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  // signed t = 0; cin >> t; while(t --> 0) 
    solve();
}

template<typename T, size_t N>
std::ostream& operator<<(std::ostream& os, const std::array<T, N>& a) {
  os << '[';
  for(size_t i = 0; i < N; ++i) {
    os << a[i] << " ";
  }
  os << "]";
  return os;
}

template<typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) {
  os << "(" << p.first << ", " << p.second << ") ";
  return os;
}
 
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
  os << '[';
  for(auto x : v)
    os << x << " ";
  os << "] ";
  return os;
}
 
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& s) {
  os << "{";
  for(auto x : s)
    os << x << ", ";
  os << "} ";
  return os;
}
 
template<typename T, typename cmp>
std::ostream& operator<<(std::ostream& os, const std::set<T, cmp>& s) {
  os << "{";
  for(auto x : s)
    os << x << ", ";
  os << "} ";
  return os;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 460 KB Output is correct
27 Correct 3 ms 1116 KB Output is correct
28 Correct 3 ms 976 KB Output is correct
29 Correct 3 ms 1116 KB Output is correct
30 Correct 2 ms 1116 KB Output is correct
31 Correct 2 ms 976 KB Output is correct
32 Correct 3 ms 1112 KB Output is correct
33 Correct 2 ms 1116 KB Output is correct
34 Correct 2 ms 1380 KB Output is correct
35 Correct 2 ms 1096 KB Output is correct
36 Correct 2 ms 1116 KB Output is correct
37 Correct 3 ms 1096 KB Output is correct
38 Correct 3 ms 1112 KB Output is correct
39 Correct 3 ms 1116 KB Output is correct
40 Correct 2 ms 1116 KB Output is correct
41 Correct 2 ms 1368 KB Output is correct
42 Correct 2 ms 1116 KB Output is correct
43 Correct 3 ms 1116 KB Output is correct
44 Correct 2 ms 1076 KB Output is correct
45 Correct 2 ms 1116 KB Output is correct
46 Correct 2 ms 1116 KB Output is correct
47 Correct 2 ms 1116 KB Output is correct
48 Correct 2 ms 1116 KB Output is correct
49 Correct 2 ms 1112 KB Output is correct
50 Correct 2 ms 1116 KB Output is correct
51 Correct 2 ms 1116 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 460 KB Output is correct
27 Correct 3 ms 1116 KB Output is correct
28 Correct 3 ms 976 KB Output is correct
29 Correct 3 ms 1116 KB Output is correct
30 Correct 2 ms 1116 KB Output is correct
31 Correct 2 ms 976 KB Output is correct
32 Correct 3 ms 1112 KB Output is correct
33 Correct 2 ms 1116 KB Output is correct
34 Correct 2 ms 1380 KB Output is correct
35 Correct 2 ms 1096 KB Output is correct
36 Correct 2 ms 1116 KB Output is correct
37 Correct 3 ms 1096 KB Output is correct
38 Correct 3 ms 1112 KB Output is correct
39 Correct 3 ms 1116 KB Output is correct
40 Correct 2 ms 1116 KB Output is correct
41 Correct 2 ms 1368 KB Output is correct
42 Correct 2 ms 1116 KB Output is correct
43 Correct 3 ms 1116 KB Output is correct
44 Correct 2 ms 1076 KB Output is correct
45 Correct 2 ms 1116 KB Output is correct
46 Correct 2 ms 1116 KB Output is correct
47 Correct 2 ms 1116 KB Output is correct
48 Correct 2 ms 1116 KB Output is correct
49 Correct 2 ms 1112 KB Output is correct
50 Correct 2 ms 1116 KB Output is correct
51 Correct 2 ms 1116 KB Output is correct
52 Correct 219 ms 67668 KB Output is correct
53 Correct 224 ms 67728 KB Output is correct
54 Correct 263 ms 67824 KB Output is correct
55 Correct 229 ms 67812 KB Output is correct
56 Correct 246 ms 67720 KB Output is correct
57 Correct 247 ms 67696 KB Output is correct
58 Correct 259 ms 67892 KB Output is correct
59 Correct 229 ms 67664 KB Output is correct
60 Correct 229 ms 68204 KB Output is correct
61 Correct 249 ms 67712 KB Output is correct
62 Correct 224 ms 67892 KB Output is correct
63 Correct 267 ms 67896 KB Output is correct
64 Correct 223 ms 67712 KB Output is correct
65 Correct 226 ms 67696 KB Output is correct
66 Correct 224 ms 67696 KB Output is correct
67 Correct 227 ms 67668 KB Output is correct
68 Correct 257 ms 68072 KB Output is correct