FilesExpand file tree

 master

/

A.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

55 lines (47 loc) · 859 Bytes

 master

/

A.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

55 lines (47 loc) · 859 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

#include <iostream>

#include <algorithm>

#include <vector>

using namespace std;

const int MAXN = 10001;

int S,N;

typedef struct _node{

int x, y;

}dragon;

dragon dragons[MAXN];

bool cmp(const dragon &a, const dragon &b){

if(a.x==b.x){

return a.y>b.y;

}else{

return a.x<b.x;

}

}

void work(){

sort(dragons, dragons+N, cmp);

/*

for(int i=0; i<N; i++){

cout<<dragons[i].x<<" "<<dragons[i].y<<endl;

}

*/

bool ok =true;

for(int i=0; i<N; i++){

if(S<=dragons[i].x){

ok = false;

break;

}else{

S+=dragons[i].y;

}

}

if(ok){

cout<<"YES"<<endl;

}else{

cout<<"NO"<<endl;

}

}

int main(){

cin>>S>>N;

for(int i=0; i<N; i++){

cin>>dragons[i].x>>dragons[i].y;

}

work();

return 0;

}