A.买买买

Love The Way You Lie 2022-08-07 09:49 244阅读 0赞

<table style="border-collapse:collapse; border-spacing:0px; border:1px solid rgb(206,225,238); margin:20px auto 0px; width:790px; background:rgb(240,245,248)"> 
 <tbody> 
  <tr style="padding:0px"> 
   <td style="padding:30px 10px; color:rgb(26,92,200); font-family:'Times New Roman'; font-size:32px; font-weight:bold; text-align:center"> A.买买买</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:3px 10px"> 
    <table style="border-collapse:collapse; border-spacing:0px; border:0px; margin:0px auto; color:green; font-size:10pt"> 
     <tbody> 
      <tr style="padding:0px"> 
       <td style="padding:3px 10px">Time Limit: 500 MS</td> 
       <td style="padding:3px 10px">Memory Limit: 32768 K</td> 
      </tr> 
     </tbody> 
    </table> 
    <table style="border-collapse:collapse; border-spacing:0px; border:0px; margin:0px auto; color:green; font-size:10pt"> 
     <tbody> 
      <tr style="padding:0px"> 
       <td style="padding:3px 10px">Total Submit: 625 <span style="font-size:8pt"> (398 users)</span></td> 
       <td style="padding:3px 10px">Total Accepted: 464 <span style="font-size:8pt"> (389 users)</span></td> 
       <td style="padding:3px 10px">Special Judge:&nbsp;<span style="font-size:8pt">No</span></td> 
      </tr> 
     </tbody> 
    </table> </td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; color:rgb(124,169,237); font-family:Arial; font-size:18px; font-weight:bold; width:770px"> Description</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; font-family:'courier new',courier,monospace; font-size:13px; table-layout:fixed; width:770px; word-break:break-all; word-wrap:break-word"> xiaodao 喜欢 Lo 裙，她决定买一件美观度不小于 X 的裙子。<br> Lo 裙店现在有 N 件裙子，每件裙子的美观程度和价格分别为 Pi 和 Ci。<br> xiaodao 现在只剩下 K 个单位钱。<br> 问 xiaodao 是否可以买到一件令自己满意的裙子。</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; color:rgb(124,169,237); font-family:Arial; font-size:18px; font-weight:bold; width:770px"> Input</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; font-family:'courier new',courier,monospace; font-size:13px; table-layout:fixed; width:770px; word-break:break-all; word-wrap:break-word"> 第一行一个整数T，代表有T组数据。<br> 每组数据第一行有三个正整数 N, X, K。<br> 接下来的 N 行每行有两个正整数 Pi, Ci。<br> 所有正整数都在10000以内。</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; color:rgb(124,169,237); font-family:Arial; font-size:18px; font-weight:bold; width:770px"> Output</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; font-family:'courier new',courier,monospace; font-size:13px; table-layout:fixed; width:770px; word-break:break-all; word-wrap:break-word"> 对于每组数据，输出一行表示对应的答案。<br> 如果可以输出 “Yes”，否则输出 “No”。</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; color:rgb(124,169,237); font-family:Arial; font-size:18px; font-weight:bold; width:770px"> Sample Input</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; font-family:'courier new',courier,monospace; font-size:13px; table-layout:fixed; width:770px; word-break:break-all; word-wrap:break-word"> 2<br> 1 4 5<br> 4 5<br> 2 5 5<br> 4 6<br> 6 4</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; color:rgb(124,169,237); font-family:Arial; font-size:18px; font-weight:bold; width:770px"> Sample Output</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; font-family:'courier new',courier,monospace; font-size:13px; table-layout:fixed; width:770px; word-break:break-all; word-wrap:break-word"> Yes<br> No</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; color:rgb(124,169,237); font-family:Arial; font-size:18px; font-weight:bold; width:770px"> Hint</td> 
  </tr> 
  <tr style="padding:0px"> 
   <td style="padding:10px; font-family:'courier new',courier,monospace; font-size:13px; table-layout:fixed; width:770px; word-break:break-all; word-wrap:break-word"> <span style="white-space:nowrap">出题人的意思是恰好花光k元。。。</span></td> 
  </tr> 
 </tbody> 
</table>

#include<cstdio>
    #include<algorithm>
    using namespace std;
    struct qunzi
    {
        int p;
        int c;
    }q[10000];
    int compare(qunzi a,qunzi b)
    {
        a.p>b.p;
    }
    int main()
    {
        int times,n,k,x,f,i;
        scanf("%d",×);
        while(times--)
        {
            f=0;
            scanf("%d%d%d",&n,&x,&k);
            for(i=0;i<n;i++)
            {
                scanf("%d%d",&q[i].p,&q[i].c);
            }
            sort(q,q+n,compare);
            for(i=0;i<n;i++)
            {
                if(q[i].p>=x)
                {
                    if(q[i].c==k)
                    {
                        f=1;
                        break;
                    }
                }
                else
                {
                    break;
                }
            }
            if(f==1)
            {
                printf("Yes\n");
            }
            else
            {
                printf("No\n");
            }
        }
    }