我的CodeF水A题之路

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #include<map>
 6 using namespace std;
 7 #define LL long long
 8 int n;
 9 LL xx;
10 struct node
11 {
12     int kid;
13     LL x;
14     char c;
15 }X[1010];
16 int main()
17 {
18    while(scanf("%d%d",&n,&xx)!=EOF)
19    {
20        for(int i=0;i<n;i++)
21        {
22            X[i].kid=i+1;
23            cin>>X[i].c;
24            cin>>X[i].x;
25        }
26        for(int i=0;i<n;i++)
27        {
28            if(X[i].c==‘+‘)
29                xx+=X[i].x;
30             if(X[i].c==‘-‘)
31             {
32                 if(xx>=X[i].x)
33                     xx-=X[i].x;
34                 else
35                     X[i].kid=0;
36             }
37        }
38        int s=0;
39        for(int i=0;i<n;i++)
40        {
41            if(X[i].kid==0)
42             s++;
43        }
44        printf("%I64d %d\n",xx,s);
45    }
46    return 0;
47 }