제출 #1303273

#제출 시각아이디문제언어결과실행 시간메모리
1303273kvintsekstakordArt Exhibition (JOI18_art)C++17
0 / 100
4 ms332 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int64_t> a(n); vector<int64_t> b(n); for(int i = 0; i < n; i++){ int64_t x, y; cin >> x >> y; a[i]=x; b[i]=y; } int64_t ans = 0; for(int i = 1; i < (1<<n); i++){ int64_t s = 0; int64_t mx = 0; int64_t mn = 1e10; for(int j = 0; j < n; j++){ if(!((i>>j)&1)) continue; s+=b[j]; mn = min(mn, a[j]); mx = max(mx, a[j]); } ans = max(ans, s-mx+mn); } cout << ans << endl; 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...