oj.uz

답안 #117087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
117087 2019-06-14T17:19:09 Z johutha Sure Bet (CEOI17_sure) C++14
60 / 100
 86 ms 3704 KB 
#include <iostream>
#include <vector>
#include <algorithm>
 
#define int int64_t
 
using namespace std;
 
signed main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  
  int n;
  cin >> n;
  
  vector<double> a(n);
  vector<double> b(n);
  
  for (int i = 0; i < n; i++)
  {
    cin >> a[i] >> b[i];
  }
  
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());

  reverse(a.begin(), a.end());
  reverse(b.begin(), b.end());
  
  int ac = 0;
  int bc = 0;
  
  double glmax = 0;
  
  double curra = 0;
  double currb = 0;
  
  while (ac + bc < 2*n)
  {
    curra -= 1;
    currb -= 1;
    if (ac == n || currb < curra)
    {
      currb += b[bc];
      bc++;
    }
    else
    {
      curra += a[ac];
      ac++;
    }
    glmax = max(glmax, min(curra, currb));
  }
  printf("%.4lf",(double)glmax);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 428 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 428 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 80 ms 3224 KB Output is correct
18 Correct 80 ms 3352 KB Output is correct
19 Correct 80 ms 3324 KB Output is correct
20 Correct 80 ms 3192 KB Output is correct
21 Incorrect 86 ms 3704 KB Output isn't correct
22 Halted 0 ms 0 KB -