• <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

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            国产精品女同久久久久电影院| 久久久精品国产Sm最大网站| 久久久久se色偷偷亚洲精品av| 国产成人久久精品一区二区三区 | 国产精品免费久久久久电影网| 成人亚洲欧美久久久久| 亚洲国产精品一区二区三区久久| 性做久久久久久久| 亚洲国产精品成人久久蜜臀 | 国内精品伊人久久久久影院对白| 色狠狠久久综合网| 午夜不卡888久久| 久久无码中文字幕东京热| 草草久久久无码国产专区| 久久婷婷国产综合精品| 久久综合久久性久99毛片| 人人狠狠综合久久亚洲婷婷 | 国产99久久久国产精品~~牛 | 精品久久久久久久久免费影院| 亚洲国产精品久久久久久| 99久久婷婷国产综合亚洲| 欧美大香线蕉线伊人久久| 久久只有这里有精品4| 久久无码精品一区二区三区| 久久综合狠狠色综合伊人| 97精品久久天干天天天按摩| 无码专区久久综合久中文字幕| 久久笫一福利免费导航| 亚洲人成无码网站久久99热国产 | 亚洲成色www久久网站夜月| 国产精品美女久久福利网站| 人人狠狠综合久久亚洲| 精品久久久久久久中文字幕| 国产精品美女久久久久av爽| 久久99精品国产麻豆蜜芽| 久久久久国产精品嫩草影院| 久久亚洲电影| 欧美黑人激情性久久| 7777久久久国产精品消防器材| 中文字幕久久亚洲一区| 亚洲国产精品18久久久久久|