• <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)  編輯 收藏 引用
            <2009年1月>
            28293031123
            45678910
            11121314151617
            18192021222324
            25262728293031
            1234567

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            色99久久久久高潮综合影院| 久久免费看黄a级毛片| 99久久久国产精品免费无卡顿| 欧美熟妇另类久久久久久不卡| 99久久人妻无码精品系列蜜桃| 伊人色综合久久天天| 亚洲国产成人久久综合碰| 久久综合狠狠综合久久| 青青草原综合久久| 蜜臀久久99精品久久久久久| 亚洲欧美国产日韩综合久久| 色欲av伊人久久大香线蕉影院| 久久99中文字幕久久| 久久伊人五月丁香狠狠色| 久久夜色精品国产噜噜噜亚洲AV| 久久香蕉一级毛片| 日本WV一本一道久久香蕉| 久久精品二区| 日本久久久久久中文字幕| 天堂久久天堂AV色综合| 久久综合亚洲色HEZYO国产| 精品久久久久中文字幕日本| 无码国内精品久久综合88| 国产成人无码精品久久久免费| 国产69精品久久久久久人妻精品| 久久久黄片| 国产 亚洲 欧美 另类 久久| 久久久久人妻一区精品性色av| 一本久久精品一区二区| 日韩精品无码久久一区二区三| 国产精品9999久久久久| 久久久久亚洲av无码专区| 精品久久久一二三区| 天天综合久久一二三区| 日本精品久久久久久久久免费| 国产成人香蕉久久久久| 久久黄色视频| 亚洲人AV永久一区二区三区久久| 久久久久久青草大香综合精品| 久久无码国产| 久久精品国产亚洲AV久|