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

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            国产激情久久久久久熟女老人| 亚洲中文字幕无码久久精品1| 国产精品毛片久久久久久久 | 思思久久99热免费精品6| 综合久久一区二区三区 | 国内精品久久久久伊人av| 99久久成人国产精品免费| 久久久久久青草大香综合精品| 亚洲国产美女精品久久久久∴| 2020最新久久久视精品爱 | 狠狠人妻久久久久久综合蜜桃| 久久精品日日躁夜夜躁欧美| 久久久久中文字幕| 久久精品国产99久久久古代 | 亚洲色欲久久久久综合网| 久久超碰97人人做人人爱| 日韩一区二区久久久久久| 一本久久a久久精品vr综合| 久久久久久久国产免费看| 国产精品99久久精品| 久久天天躁狠狠躁夜夜不卡| 精品无码久久久久久久动漫| 国产成人久久精品激情| 国产偷久久久精品专区| 香蕉99久久国产综合精品宅男自 | 品成人欧美大片久久国产欧美... 品成人欧美大片久久国产欧美 | 国产精品乱码久久久久久软件 | 91精品国产色综久久| 色妞色综合久久夜夜| 久久人人爽人人人人爽AV| 久久人人爽人人精品视频| 国产午夜精品理论片久久| 一级做a爱片久久毛片| 国产精品九九九久久九九| 精品久久久噜噜噜久久久| 亚洲国产精品无码成人片久久| 精品久久久久久无码不卡| 色青青草原桃花久久综合| 中文字幕久久亚洲一区| 亚洲精品tv久久久久久久久| 久久精品www人人爽人人|