Submission #1187954

#TimeUsernameProblemLanguageResultExecution timeMemory
1187954FZ_LaabidiSure Bet (CEOI17_sure)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h> #define int long long #define F first #define S second #define pb push_back #pragma GCC optimize("Ofast") #pragma GCC target("avx,avx2,fma") #define dd double using namespace std; signed main() { int n; cin >> n; vector<dd> a(n), c(n); for (int i=0; i<n; i++)cin >> a[i] >> c[i]; sort(a.begin(), a.end(), greater<dd>()); sort(c.begin(), c.end(), greater<dd>()); vector<dd>prefa(n), prefc(n); prefa[0]= a[0]; prefc[0]= c[0]; for (int i=1; i<n; i++) { prefa[i]= prefa[i-1]+a[i]; prefc[i]= prefc[i-1]+c[i]; } dd vi=0; for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { dd jj = j, ii=i, doo=2; vi = max(vi, min(prefa[i],prefc[j])-doo-ii-jj); //cout << prefa[i]<< " "<< prefc[j]<< endl; } } cout << setprecision(5)<< vi << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...