• <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
            拿道水題開(kāi)心......
            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) 評(píng)論(0)  編輯 收藏 引用

            只有注冊(cè)用戶(hù)登錄后才能發(fā)表評(píng)論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問(wèn)   Chat2DB   管理


            <2025年8月>
            272829303112
            3456789
            10111213141516
            17181920212223
            24252627282930
            31123456

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            亚洲国产另类久久久精品黑人| 亚洲av伊人久久综合密臀性色 | 国产精品狼人久久久久影院| 成人亚洲欧美久久久久| 香蕉久久夜色精品国产2020| 婷婷伊人久久大香线蕉AV| 秋霞久久国产精品电影院| 亚洲精品NV久久久久久久久久| 久久丫精品国产亚洲av不卡| 久久精品女人天堂AV麻| 亚洲熟妇无码另类久久久| Xx性欧美肥妇精品久久久久久| 色狠狠久久综合网| 9999国产精品欧美久久久久久| 亚洲精品乱码久久久久久按摩 | 99久久免费国产精品特黄| 成人久久综合网| 一本色道久久88—综合亚洲精品 | 精品无码久久久久久午夜| 久久久午夜精品福利内容| 国产精品综合久久第一页| 97超级碰碰碰久久久久| 亚洲精品乱码久久久久久蜜桃不卡 | 亚洲欧洲中文日韩久久AV乱码| 久久久91精品国产一区二区三区| 亚洲国产成人精品女人久久久| 91精品国产91热久久久久福利| 久久精品午夜一区二区福利| 久久久久av无码免费网| 中文国产成人精品久久亚洲精品AⅤ无码精品 | 漂亮人妻被中出中文字幕久久| 精品久久久久国产免费| 亚洲一区中文字幕久久| 草草久久久无码国产专区| 97超级碰碰碰碰久久久久| 亚洲伊人久久大香线蕉苏妲己| 日本精品久久久中文字幕 | 久久久久亚洲AV无码麻豆| 久久婷婷五月综合色奶水99啪| 77777亚洲午夜久久多人| 久久夜色精品国产噜噜麻豆|