#include <bits/stdc++.h>
#define int long long
#define float long double
#define endl "\n"
using namespace std;
bool f(float a, float b){
return a>b;
}
float binarySearch(vector<float>arr, float l, float r, float x){
if(arr[l]>=x)
return l;
if(arr[l+1]>=x)
return l;
if(arr[r]<=x)
return r-1;
while (l <= r) {
float m = l + (r - l) / 2;
if(arr[m]<=x && arr[m+1]>=x)
return m;
if (arr[m+1] < x)
l = m;
else
r = m;
}
return -1;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
float n;
cin>>n;
vector<float>a(n);
vector<float>b(n);
for(float i=0;i<n;i++){
cin>>a[i]>>b[i];
}
sort(a.begin(),a.end(),f);
sort(b.begin(),b.end(),f);
vector<float>b_pref;
float s=0;
b_pref.push_back(0);
for(float i=0;i<n;i++){
s+=b[i];
b_pref.push_back(s);
}
s=0;
float score=0;
for(float i=0;i<n;i++){
s+=a[i];
float j=binarySearch(b_pref,0,n,s);
cout<<b_pref[j]<<" "<<b_pref[j+1]<<" "<<s<<" ";
float s1=min(s,b_pref[j])-i-j-1;
float s2=min(s,b_pref[j+1])-i-j-2;
cout<<s1<<" "<<s2<<endl;
score=max(score,s2);
score=max(score,s1);
}
cout<<score;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
