| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 604924 | pakhomovee | Sure Bet (CEOI17_sure) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <random>
#include <algorithm>
#include <cassert>#include <iostream>
#include <vector>
#include <random>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iomanip>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<double> a(n);
vector<double> b(n);
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
vector<double> pa(n + 1, 0);
vector<double> pb(n + 1, 0);
for (int i = 1; i <= n; ++i) {
pa[i] = pa[i - 1] + a[i - 1];
pb[i] = pb[i - 1] + b[i - 1];
}
auto slv = [&] (vector<double> pa, vector<double> pb) {
double ans = 0;
for (int i = 0; i <= n; ++i) {
if (pb.back() < pa[i]) break;
int j = lower_bound(pb.begin(), pb.end(), pa[i]) - pb.begin();
ans = max(ans, pa[i] - i - j);
}
return ans;
};
cout << fixed << setprecision(4) << max(slv(pa, pb), slv(pb, pa));
}
#include <cstring>
#include <iomanip>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<double> a(n);
vector<double> b(n);
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
double res = 0;
double ans = 0;
double sa = 0;
for (int i = 0; i <= n; ++i) {
double sb = 0;
for (int j = 0; j <= n; ++j) {
ans = max(ans, min(sa, sb) - i - j);
if (j < n) {
sb += b[j];
}
}
if (i < n) {
sa += a[i];
}
}
cout << fixed << setprecision(10) << ans;
}