제출 #939183

#제출 시각아이디문제언어결과실행 시간메모리
939183vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
146 ms12524 KiB
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3") #include<bits/stdc++.h> using namespace std; #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define sz(a) (int)a.size() #define s second #define f first using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}}; const int N = 1e6 + 1, mod = 1e9 + 7; const ll inf = 1e18; double eps = 1e-15; bool flg = 0; void slv() { int n; cin >> n; vector<pll> s; s.push_back({-inf, -inf}); for (int i = 1; i <= n; i++) { ll a, b; cin >> a >> b; s.push_back({a, b}); } sort(all(s)); ll p[n + 1]; p[0] = 0; for (int i = 1; i <= n; i++) p[i] = p[i - 1] + s[i].s; ll mx = -inf, ans = -inf; for (int i = 1; i <= n; i++) { mx = max(mx, -p[i - 1] + s[i].f); ans = max(ans, p[i] - s[i].f + mx); } cout << ans; } main() { //freopen("rsq.in", "r", stdin); //freopen("rsq.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); int tp = 1; if (flg) cin >> tp; while (tp--) { //cout << "Case #" << cur++ << ": "; slv(); } } //wenomechainsama

컴파일 시 표준 에러 (stderr) 메시지

art.cpp:54:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   54 | main() {
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...