Sicily-1134

一．      题意

按照孩子们需要的积木块数排序（从小到大），先处理需要积木块数少的孩子。

二．      代码

 //
 //  main.cpp
 //  sicily-1134
 //
 //  Created by ashley on 14-10-25.
 //  Copyright (c) 2014年 ashley. All rights reserved.
 //
 
 #include <iostream>
 #include <algorithm>
 using namespace std;
 
 typedef struct
 {
     long ownCake;
     long wantCake;
 }child;
 
 child childs[];
 
 bool compare(child left, child right)
 {
     return left.wantCake < right.wantCake;
 }
 
 int main(int argc, const char * argv[])
 {
     int childrenNum;
     long currentNum, cakeNum;
     bool success;
     while (cin >> childrenNum >> cakeNum) {
         if (childrenNum == ) {
             break;
         }
         success = true;
         currentNum = cakeNum;
         for (int i = ; i < childrenNum; i++) {
             cin >> childs[i].ownCake >> childs[i].wantCake;
         }
         sort(childs, childs + childrenNum, compare);
         for (int i = ; i < childrenNum; i++) {
             if (childs[i].wantCake > currentNum) {
                 success = false;
                 cout << "NO" << endl;
                 break;
             } else {
                 currentNum = currentNum + childs[i].ownCake;
             }
         }
         if (success) {
             cout << "YES" << endl;
         }
     }
     return ;
 }