oj.uz

답안 #90760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90760 2018-12-24T10:30:11 Z Aydarov03 학교 설립 (IZhO13_school) C++14
5 / 100
 437 ms 35256 KB 
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define fr first
#define sc second
using namespace std;

vector < pii > v;
vector < pii > v1 , v2;

main()
{
    multiset < int > rz;
    multiset < pii> v1 , v2;

    int x , y;
    int n , m , s , ans = 0;
    cin >> n >> m >> s;



    for(int i = 1; i <= n; i++)
    {
        scanf("%lld%lld" , &x , &y);
        v.push_back( {x , y} );
    }

    sort( v.rbegin() , v.rend() );
    for(int i = 0; i < m; i++)
    {
        ans += v[i].fr;
        rz.insert( -(v[i].fr - v[i].sc) );
    }

    for(int i = m; i < n; i++)
    {
        v1.insert( v[i] );
        v2.insert( {v[i].sc , v[i].fr} );
    }



    for(int i = s; i >= 1; i--)
    {
        pii x = *v1.rbegin();
        pii y = *v2.rbegin();
        int raz = *rz.begin();

        if( x.fr + raz > y.fr )
        {
            ans += (x.fr + raz);
            rz.erase( rz.begin() );
            rz.insert( -( x.fr - x.sc ) );
            v1.erase( v1.find( {x.fr , x.sc}) );
            v2.erase( v2.find( {x.sc , x.fr} ) );
        }
        else
        {

            ans += y.fr;
            v2.erase( v2.find( {y.fr , y.sc } ) );
            v1.erase( v1.find( { y.sc , y.fr } ) );
        }
    }
    cout << ans << endl;


}

Compilation message

school.cpp:11:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
school.cpp: In function 'int main()':
school.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld" , &x , &y);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 380 KB Output isn't correct
2 Correct 2 ms 508 KB Output is correct
3 Incorrect 2 ms 556 KB Output isn't correct
4 Incorrect 2 ms 556 KB Output isn't correct
5 Incorrect 2 ms 556 KB Output isn't correct
6 Incorrect 2 ms 684 KB Output isn't correct
7 Incorrect 5 ms 1120 KB Output isn't correct
8 Incorrect 4 ms 1120 KB Output isn't correct
9 Incorrect 4 ms 1120 KB Output isn't correct
10 Incorrect 4 ms 1120 KB Output isn't correct
11 Incorrect 6 ms 1248 KB Output isn't correct
12 Incorrect 6 ms 1248 KB Output isn't correct
13 Incorrect 24 ms 3152 KB Output isn't correct
14 Incorrect 128 ms 10896 KB Output isn't correct
15 Incorrect 271 ms 22860 KB Output isn't correct
16 Incorrect 437 ms 24132 KB Output isn't correct
17 Incorrect 266 ms 24932 KB Output isn't correct
18 Incorrect 266 ms 27204 KB Output isn't correct
19 Incorrect 287 ms 29816 KB Output isn't correct
20 Incorrect 360 ms 35256 KB Output isn't correct