Submission #865321

#TimeUsernameProblemLanguageResultExecution timeMemory
865321vjudge1Sure Bet (CEOI17_sure)C++17
0 / 100
0 ms348 KiB
#include <map> #include <set> #include <list> #include <cmath> #include <ctime> #include <deque> #include <queue> #include <stack> #include <string> #include <bitset> #include <cstdio> #include <limits> #include <vector> #include <climits> #include <cstring> #include <cstdlib> #include <fstream> #include <numeric> #include <sstream> #include <cassert> #include <iomanip> #include <iostream> #include <algorithm> #include <stdio.h> #include <fstream> #include <unordered_map> using namespace std; typedef long long ll; typedef long double ld; #define all(x) x.begin(),x.end() #define pb push_back #define ent "\n" const int maxn = (int)3e5 + 13; const ll inf = (long long)1e18 + 20; const int mod = (int)1e9 + 7; int n; pair<ld,ld>a[maxn]; void solve(){ cin >> n; for(int i = 1 ; i <= n ; i ++){ cin >> a[i].first >> a[i].second; } sort(a + 1,a + 1 + n); reverse(a + 1,a + 1 + n); ld ans = 0,mx = 0; for(int i = 1 ; i <= n ; i ++){ ans += a[i].first; ld sum = 0; for(int j = i + 1 ; j <= n ; j ++){ ld kol = j; sum += a[j].second; //cout << i << ' ' << j << ' ' << sum - kol << ent; mx = max(mx,min(sum,ans) - kol); } } cout << mx; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; //cin >> t; while(t --){ solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...