oj.uz

Submission #359761

# Submission time Handle Problem Language Result Execution time Memory
359761 2021-01-27T07:42:47 Z shahriarkhan Sure Bet (CEOI17_sure) C++14
20 / 100
 1 ms 364 KB 
#include<bits/stdc++.h>
using namespace std ;

const long long c = 1e5 ;

int main()
{
    int n ;
    scanf("%d",&n) ;
    priority_queue<long long> a , b ;
    long long x = 0 , y = 0 , ans = 0 ;
    for(int i = 1 ; i <= n ; ++i)
    {
        double ad , bd ;
        cin>>ad>>bd ;
        long long ac = (ad*c) , bc = (bd*c) ;
        a.push(ac-c) , b.push(bc-c) ;
    }
    while(!a.empty())
    {
        x += a.top() , y -= c ;
        a.pop() ;
        while(!b.empty())
        {
            if(min(x-c,y+b.top())>=min(x,y))
            {
                x -= c , y += b.top() ;
                b.pop() ;
            }
            else break ;
        }
        ans = max(ans,min(x,y)) ;
    }
    long double p = ans , q = c ;
    cout<<fixed<<setprecision(4)<<p/q<<endl ;
    return 0 ;
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 |     scanf("%d",&n) ;
      |     ~~~~~^~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 268 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 268 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 268 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -