• <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 閱讀(280) 評論(0)  編輯 收藏 引用
            <2009年1月>
            28293031123
            45678910
            11121314151617
            18192021222324
            25262728293031
            1234567

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            亚洲综合婷婷久久| 久久久高清免费视频| 国内精品久久久久久久影视麻豆| 久久狠狠色狠狠色综合| 国内精品久久久久久久久| 久久无码专区国产精品发布| 无码日韩人妻精品久久蜜桃| 久久精品无码一区二区app| 人妻无码αv中文字幕久久琪琪布| 久久国产精品77777| 日本高清无卡码一区二区久久| 亚洲av日韩精品久久久久久a | 久久天天躁狠狠躁夜夜avapp| 996久久国产精品线观看| 一本久久a久久精品vr综合| 国产福利电影一区二区三区久久老子无码午夜伦不 | 奇米影视7777久久精品人人爽| 国产成人精品免费久久久久| 久久狠狠爱亚洲综合影院| 久久精品亚洲福利| 久久免费精品一区二区| 国产亚洲欧美精品久久久| 久久精品国产亚洲AV香蕉| 亚洲а∨天堂久久精品9966| 久久精品这里只有精99品| 99久久精品国产综合一区| 久久香蕉综合色一综合色88| 久久久免费精品re6| 五月丁香综合激情六月久久| 久久久久亚洲av成人网人人软件| 久久亚洲国产成人精品无码区| 久久久久久久综合日本亚洲 | 久久这里只有精品18| 偷窥少妇久久久久久久久| 天天做夜夜做久久做狠狠| 久久AAAA片一区二区| 欧美日韩精品久久久免费观看| 精品久久人人做人人爽综合| 国产—久久香蕉国产线看观看| 久久成人国产精品一区二区| 久久精品国产色蜜蜜麻豆|