fork(1) download
copy 
  1. #include <bits/stdc++.h>
  2. #define f first 
  3. #define s second
  4. using namespace std ;
  5.  
  6. pair<long long,long long> data[1001] ;
  7.  
  8. bool cmp(pair<long long ,long long> a ,pair<long long ,long long> b )
  9. {
  10.  
  11.     return a.f < b.f;
  12. }
  13.  
  14.  
  15. int main()
  16. {
  17. 	long long s,n ;
  18. 	bool flag = 1 ;
  19. 	cin >> s >> n ;
  20.     for(int i =0 ; i < n ; i++)
  21.     {
  22.     	cin >> data[i].f >> data[i].s ;
  23. 	}
  24. 	sort(data , data+n ,cmp) ;
  25. 	for(int i = 0 ; i < n ; i++)
  26. 	{
  27. 		if(data[i].f < s)
  28. 		{
  29. 			s = s+ data[i].s ;
  30. 		}
  31. 		else
  32. 		{
  33. 		 flag = 0 ;
  34. 		  cout <<"NO" <<endl ;
  35. 	     break ;
  36. 		}
  37. 	}
  38. 	if(flag)
  39. 	cout <<"YES"<<endl ;
  40.  
  41.  
  42.  
  43.     return 0 ;
  44. }
Time limit exceeded #stdin #stdout 5s 2748KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/bXjRXf
language:
C++ 4.3.2 (gcc-4.3.2)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!