oj.uz

Submission #117086

# Submission time Handle Problem Language Result Execution time Memory
117086 2019-06-14T17:16:12 Z johutha Sure Bet (CEOI17_sure) C++14
0 / 100
 3 ms 384 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());
  
  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
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -