Submission #1158590

#TimeUsernameProblemLanguageResultExecution timeMemory
1158590HakunaArt Exhibition (JOI18_art)C++20
0 / 100
4 ms400 KiB
#include <bits/stdc++.h> using namespace std; int n; pair<long long, long long> p[(int)5e5 + 10]; long long pref[(int) 5e5 + 10]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> p[i].first >> p[i].second; } sort(p + 1, p + n + 1); long long ans = 0; for (int mask = 0; mask < (1 << n); mask++) { if (!__builtin_popcount(mask)) continue; long long mx = 0, mn = LLONG_MAX, sum = 0; for (int i = 0; i < n; i++) { if ((mask >> i) & 1) { mx = max(mx, p[i].first); mn = min(mn, p[i].first); sum += p[i].second; } } ans = max(ans, sum - mx + mn); } cout << ans; 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...