• <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)  編輯 收藏 引用
            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            99久久国产亚洲高清观看2024| 精品久久久久久无码中文野结衣| 热99RE久久精品这里都是精品免费 | 日本久久久精品中文字幕| 久久精品国产亚洲av日韩| 99久久综合狠狠综合久久| 久久综合九色欧美综合狠狠| 国产成人精品三上悠亚久久| 久久婷婷久久一区二区三区| 亚洲人成电影网站久久| 久久香蕉一级毛片| 亚洲中文字幕无码久久2020| 99久久精品这里只有精品| 亚洲AV无码久久| 亚洲国产一成久久精品国产成人综合| 婷婷伊人久久大香线蕉AV | 久久久久久国产精品美女| av无码久久久久不卡免费网站| 亚洲欧美久久久久9999 | 久久久久国产精品人妻| 久久精品亚洲乱码伦伦中文 | 久久精品无码一区二区三区免费| avtt天堂网久久精品| 久久久精品人妻一区二区三区蜜桃 | 午夜精品久久久久久久久| 久久久久亚洲AV成人网| 久久国产高清字幕中文| 精品久久久久香蕉网| 亚洲精品无码久久久久| 99久久精品国产一区二区 | 久久精品国产99久久无毒不卡| 四虎亚洲国产成人久久精品| 国产成人精品久久一区二区三区av| 熟妇人妻久久中文字幕| 亚洲国产精品无码久久| 蜜臀av性久久久久蜜臀aⅴ| 亚洲香蕉网久久综合影视| 亚洲AV无码久久| 久久综合久久自在自线精品自| 久久久久女人精品毛片| 久久99精品久久久久久动态图|