제출 #1019678

#제출 시각아이디문제언어결과실행 시간메모리
1019678overwatch9Sure Bet (CEOI17_sure)C++17
0 / 100
74 ms348 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int n; cin >> n; vector <pair <ll, ll>> nums(n); for (int i = 0; i < n; i++) { double a, b; cin >> a >> b; nums[i].first = (a * 10000); nums[i].second = (b * 10000); } ll ans = 0; for (int i = 0; i < (1 << (2 * n)); i++) { ll l = 0, r = 0; int cnt = __builtin_popcount(i); for (int j = 0; j < 2*n; j++) { if (i & (1 << j)) { if (j % 2 == 0) l += nums[j/2].first; else r += nums[j/2].second; } } ans = max(ans, min(l, r) - cnt * 10000); } cout << fixed << setprecision(4) << (double)ans / 10000 << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...