제출 #52638

#제출 시각아이디문제언어결과실행 시간메모리
52638snat123Sure Bet (CEOI17_sure)C++11
0 / 100
2 ms484 KiB
#include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; long double tmp; long long a[n], b[n], x=0, y=0, res=0; for(int i=0; i<n; i++) { cin >> tmp; a[i]=tmp*10000; cin >> tmp; b[i]=tmp*10000; } sort(a, a+n); sort(b, b+n); int i=n-1, j=n-1; while(i>=0 && j>=0){ if(x>y) y+=b[j--]; else x+=a[i--]; x-=10000; y-=10000; res=max(res, min(x, y)); } tmp=1.0*res/10000; cout << fixed << setprecision(4) << tmp; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...