oj.uz

답안 #938293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938293 2024-03-05T04:18:19 Z vjudge1 Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define int long long
const int N = 2e5;
const int mod = 1e9 + 7;


signed main(){
   
   int n; cin >> n;
   vector<long double> a(n), b(n);
   for(auto &e : a) cin >> e;
   for(auto &e : b) cin >> e;
   
   
   long double ans = 0.0;
   sort(a.rbegin(), a.rend());
   sort(b.rbegin(), b.rend());
   
   long double s = 0, s1 = 0;
   int cnt = 0, i =0 ;
   for(int j = 0;j < n; j++){
	   s1+= b[j];
	   cnt++;
	   ans = max(ans, min(s, s1) - cnt);
	   while(i < n && s - cnt <= s1-cnt){
		   s+= a[i];
		   i++, cnt++;
		   ans = max(ans, min(s, s1) - cnt);
	   }
   }
  
   printf("%.4lf", (double)ans);
  return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -