• <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>
            posts - 74,  comments - 33,  trackbacks - 0
            Stamps
            Time Limit: 2000MS Memory Limit: 65536K
            Total Submissions: 4274 Accepted: 2091

            Description

            Background
            Everybody hates Raymond. He's the largest stamp collector on planet earth and because of that he always makes fun of all the others at the stamp collector parties. Fortunately everybody loves Lucy, and she has a plan. She secretly asks her friends whether they could lend her some stamps, so that she can embarrass Raymond by showing an even larger collection than his.
            Problem
            Raymond is so sure about his superiority that he always tells how many stamps he'll show. And since Lucy knows how many she owns, she knows how many more she needs. She also knows how many friends would lend her some stamps and how many each would lend. But she'd like to borrow from as few friends as possible and if she needs too many then she'd rather not do it at all. Can you tell her the minimum number of friends she needs to borrow from?

            Input

            The first line contains the number of scenarios. Each scenario describes one collectors party and its first line tells you how many stamps (from 1 to 1000000) Lucy needs to borrow and how many friends (from 1 to 1000) offer her some stamps. In a second line you’ll get the number of stamps (from 1 to 10000) each of her friends is offering.

            Output

            The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line with the minimum number of friends Lucy needs to borrow stamps from. If it’s impossible even if she borrows everything from everybody, write impossible. Terminate the output for the scenario with a blank line.

            Sample Input

            3
            100 6
            13 17 42 9 23 57
            99 6
            13 17 42 9 23 57
            1000 3
            314 159 265

            Sample Output

            Scenario #1:
            3
            
            Scenario #2:
            2
            
            Scenario #3:
            impossible
            拿道水題開心......
            FT!sort了AC!!!
            #include<stdio.h>
            #include
            <algorithm>
            using?namespace?std;
            bool?cmp(int?a,int?b)
            {
            ????
            return?a>b;????
            }
            ?
            int?main()
            {
            ????
            int?count,test,n,m,sum,i;
            ????
            int?a[10000];
            ????scanf(
            "%d",&test);
            ????count
            =0;
            ????
            while(test--)
            ????
            {
            ????????sum
            =0;
            ????????scanf(
            "%d%d",&n,&m);
            ????????
            for(i=0;i<m;i++)
            ????????????scanf(
            "%d",&a[i]);
            ????????sort(a,a
            +m,cmp);
            ????????
            for(i=0;i<m;i++)
            ????????
            {
            ????????????sum
            +=a[i];
            ????????????
            if(sum>=n)break;????
            ????????}

            ????????
            if(i!=m)printf("Scenario?#%d:\n%d\n\n",++count,i+1);
            ????????
            else?printf("Scenario?#%d:\nimpossible\n\n",++count);????
            ????}
            ????
            }
            posted on 2009-01-04 23:29 KNIGHT 閱讀(276) 評論(0)  編輯 收藏 引用
            <2009年1月>
            28293031123
            45678910
            11121314151617
            18192021222324
            25262728293031
            1234567

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久人人爽人人爽人人片av高请| 免费精品国产日韩热久久| 久久国产精品77777| 久久精品国产福利国产秒| 国产精品va久久久久久久| 亚洲国产精品成人AV无码久久综合影院 | 99999久久久久久亚洲| 国产成人久久精品麻豆一区 | 久久成人精品视频| 合区精品久久久中文字幕一区| 亚洲AV无码1区2区久久| 国产 亚洲 欧美 另类 久久| 亚洲精品蜜桃久久久久久| 99热精品久久只有精品| 色综合久久无码中文字幕| 久久久久国产成人精品亚洲午夜| 7777久久久国产精品消防器材| 久久99精品久久久久久噜噜| 久久久无码一区二区三区| 久久国产AVJUST麻豆| 狠狠人妻久久久久久综合| 久久精品国产亚洲av高清漫画| 久久久亚洲裙底偷窥综合| 久久久久久久久久免免费精品| 国产精品久久久久久久久鸭| 久久偷看各类wc女厕嘘嘘| 久久精品一本到99热免费| 久久亚洲中文字幕精品一区四| 久久久久一区二区三区| 99久久精品费精品国产一区二区| 无码专区久久综合久中文字幕| 亚洲综合精品香蕉久久网| 色欲综合久久中文字幕网| 久久综合88熟人妻| 精品综合久久久久久888蜜芽| 99久久精品国产一区二区 | 久久66热人妻偷产精品9| 狠狠88综合久久久久综合网| 91精品国产乱码久久久久久| 久久精品国产69国产精品亚洲| 97久久精品无码一区二区天美 |