• <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)論排行榜

            中文字幕精品久久久久人妻| 日韩欧美亚洲综合久久| 97热久久免费频精品99| 久久精品国产99国产精品| 久久亚洲熟女cc98cm| 久久精品国产91久久综合麻豆自制 | 久久996热精品xxxx| 久久久国产亚洲精品| 国产福利电影一区二区三区久久老子无码午夜伦不 | 午夜久久久久久禁播电影| 久久久女人与动物群交毛片| 久久婷婷五月综合国产尤物app| 国产福利电影一区二区三区久久老子无码午夜伦不 | 久久人人爽人人爽人人片av高请| 精品视频久久久久| 久久精品国产精品亚洲下载| 一本久久a久久精品综合夜夜| 久久亚洲国产午夜精品理论片| 国产V综合V亚洲欧美久久| 久久婷婷国产麻豆91天堂| 久久精品亚洲乱码伦伦中文| 久久丝袜精品中文字幕| 亚洲精品无码久久久久| 99久久人妻无码精品系列蜜桃 | 99久久精品国产麻豆| 日本免费久久久久久久网站| 久久久久亚洲AV无码专区网站| 亚洲国产精品成人久久蜜臀 | 久久久久久一区国产精品| 久久91精品国产91久久小草| 国产精品成人久久久| 日本免费一区二区久久人人澡| 久久综合狠狠综合久久| 久久毛片一区二区| 久久久精品人妻一区二区三区四 | 久久国产高清一区二区三区| 999久久久免费国产精品播放| 国产精品久久久久一区二区三区| 日韩欧美亚洲国产精品字幕久久久| 无遮挡粉嫩小泬久久久久久久 | 色天使久久综合网天天|