• <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
            性做久久久久久久久久久| 久久中文字幕一区二区| 久久人人爽人人爽人人片AV东京热| 亚洲国产高清精品线久久| 日韩精品久久无码中文字幕| 婷婷综合久久狠狠色99h| 一级女性全黄久久生活片免费| 无码超乳爆乳中文字幕久久| 国产亚洲精午夜久久久久久 | 久久99精品久久久久久| 久久99精品久久久久久齐齐| 久久亚洲春色中文字幕久久久| 久久久久久国产精品无码下载| 久久亚洲春色中文字幕久久久| 青青久久精品国产免费看| 色噜噜狠狠先锋影音久久| 一本一本久久aa综合精品| 中文国产成人精品久久亚洲精品AⅤ无码精品 | 狠狠精品久久久无码中文字幕| 香港aa三级久久三级| 伊人久久大香线蕉亚洲| 欧洲国产伦久久久久久久| 大美女久久久久久j久久| A狠狠久久蜜臀婷色中文网| 新狼窝色AV性久久久久久| 一本色综合久久| 无码8090精品久久一区| 久久精品成人欧美大片| 久久免费小视频| 国产激情久久久久影院小草| 国产国产成人精品久久| 国产成人无码久久久精品一| 久久久久99精品成人片试看| 久久久久久人妻无码| 精品免费久久久久久久| 久久久久久a亚洲欧洲aⅴ| 亚洲成色999久久网站| 狠狠综合久久综合中文88| 久久精品国产亚洲Aⅴ蜜臀色欲| 精品国产91久久久久久久a| 99精品伊人久久久大香线蕉|