//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[100005], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
double a[555555] , b[555555] ;
void solve(){
cin >> n ;
for(ll i = 1 ; i <= n ; i++){
cin >> a[i] >> b[i] ;
}
sort(a + 1 , a + n + 1 , greater < double > ()) ;
sort(b + 1 , b + n + 1 , greater < double > ()) ;
for(ll i = 1 ; i <= n ; i++){
a[i] += a[i - 1] , b[i] += b[i - 1] ;
}
double ans = -1e15 ;
for(ll i = 0 ; i <= n ; i++){
for(ll j = 0 ; j <= n ; j++){
ans = max(ans , min(a[i] - i - j , b[j] - i - j)) ;
}
}
cout << fixed << setprecision(9) << ans << endl ;
}
int main(){
fast ;
q = 1 ;
//cin >> q ;
while(q--){
solve() ;
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
7 ms |
13260 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
7 ms |
13260 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
7 ms |
13260 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
