• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            Assignments

            Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
            Total Submission(s): 252    Accepted Submission(s): 125


            Problem Description
            In a factory, there are N workers to finish two types of tasks (A and B). Each type has N tasks. Each task of type A needs xi time to finish, and each task of type B needs yj time to finish, now, you, as the boss of the factory, need to make an assignment, which makes sure that every worker could get two tasks, one in type A and one in type B, and, what's more, every worker should have task to work with and every task has to be assigned. However, you need to pay extra money to workers who work over the standard working hours, according to the company's rule. The calculation method is described as follow: if someone’ working hour t is more than the standard working hour T, you should pay t-T to him. As a thrifty boss, you want know the minimum total of overtime pay.
             

            Input
            There are multiple test cases, in each test case there are 3 lines. First line there are two positive Integers, N (N<=1000) and T (T<=1000), indicating N workers, N task-A and N task-B, standard working hour T. Each of the next two lines has N positive Integers; the first line indicates the needed time for task A1, A2…An (Ai<=1000), and the second line is for B1, B2…Bn (Bi<=1000).
             

            Output
            For each test case output the minimum Overtime wages by an integer in one line.
             

            Sample Input
            2 5 4 2 3 5
             

            Sample Output
            4
             
            //簡單貪心
            #include <iostream>
            #include 
            <cstdio>
            #include 
            <algorithm>

            const int maxn = 1000 + 5;

            using namespace std;

            bool cmp( int a, int b )
            {
                
            return a > b;
            }


            int main()
            {
                
            int a[maxn], b[maxn];
                
            int n, t, ans = 0;
                
            while( cin >> n >> t )
                
            {
                    ans 
            = 0;
                    
            forint i = 0; i < n; i++ )
                        cin 
            >> a[i];
                    
            forint i = 0; i < n; i++ )
                        cin 
            >> b[i];

                    sort( a, a 
            + n );
                    sort( b, b 
            + n, cmp );

                    
            forint i = 0; i < n; i++ )
                        
            if( a[i] + b[i] > t )
                            ans 
            += a[i] + b[i] - t;
                    cout 
            << ans << endl;
                }

                
            return 0;
            }

            posted on 2010-10-03 08:36 Vontroy 閱讀(615) 評論(0)  編輯 收藏 引用 所屬分類: 貪心HDU
            激情五月综合综合久久69| 中文字幕无码av激情不卡久久| 青青久久精品国产免费看| 久久综合色区| 97久久香蕉国产线看观看| 久久精品无码一区二区日韩AV| 国产精品久久久久a影院| 久久午夜无码鲁丝片秋霞 | 中文成人久久久久影院免费观看 | 久久青草国产手机看片福利盒子| 久久综合狠狠综合久久97色| 人妻精品久久无码专区精东影业| 久久本道久久综合伊人| 亚洲午夜久久久影院| 色综合久久天天综线观看| 久久最新精品国产| 少妇久久久久久被弄高潮| 久久国产三级无码一区二区| 91久久精品91久久性色| 噜噜噜色噜噜噜久久| 久久国产香蕉视频| 国产精品一久久香蕉国产线看| 性欧美大战久久久久久久久 | 韩国三级中文字幕hd久久精品 | 亚洲AV伊人久久青青草原| 狠狠干狠狠久久| 国产精品9999久久久久| 久久亚洲中文字幕精品一区| 国产一区二区久久久| 综合网日日天干夜夜久久| 久久久国产精华液| 久久露脸国产精品| 欧美久久亚洲精品| 久久久久这里只有精品 | 成人午夜精品久久久久久久小说| 国产亚洲精品美女久久久| 久久笫一福利免费导航| 国产精品99久久久精品无码 | 久久综合给久久狠狠97色| 狠狠综合久久综合88亚洲| 久久久一本精品99久久精品88|