CodeForces 686A

http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=405899 <a target=_blank href="http://acm.hust.edu.cn/vjudge/problem/visitOriginUrl.action?id=405899" target="_blank" style="font-family: Verdana; color: blue; text-decoration: none; background-color: rgb(255, 255, 255);">CodeForces - 686A</a> <a target=_blank href="http://acm.hust.edu.cn/vjudge/problem/visitOriginUrl.action?id=405899" target="_blank" style="font-size: 18pt; font-weight: bold; text-align: center; font-family: Arial, Helvetica, sans-serif; color: blue; text-decoration: none; background-color: rgb(255, 255, 255);">Free Ice Cream</a> Time Limit: 2000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u Submit Status Description After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer. At the start of the day they have x ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue). If a carrier with d ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take d ice cream packs comes to the house, then Kay and Gerda will give him d packs if they have enough ice cream, otherwise the child will get no ice cream at all and will leave in distress. Kay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids. Input The first line contains two space-separated integers n and x (1 ≤ n ≤ 1000, 0 ≤ x ≤ 109). Each of the next n lines contains a character '+' or '-', and an integer di, separated by a space (1 ≤ di ≤ 109). Record "+ di" in i-th line means that a carrier with di ice cream packs occupies i-th place from the start of the queue, and record "- di" means that a child who wants to take di packs stands in i-th place. Output Print two space-separated integers — number of ice cream packs left after all operations, and number of kids that left the house in distress. Sample Input Input 5 7 + 5 - 10 - 20 + 40 - 20 Output 22 1 Input 5 17 - 16 - 2 - 98+ 100- 98 Output 3 2 Source Codeforces Round #359 (Div. 2)

题意：一队人排队取或加冰淇淋，输入人数和初始冰淇淋数，输出剩下的冰淇淋数和没得到冰淇淋的人数

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<istream>
#include<ostream>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long ll;
int main(){
     ll n,x;
    char ch;
    ll t;
    while(~scanf("%lld%lld",&n,&x)){
        getchar();
        ll cnt=0;
        for(ll i=0;i<n;i++){
            scanf("%c %lld",&ch,&t);
            if(ch=='+')x+=t;
            else {
                if(x>=t)x-=t;
                else cnt++;
            }
            getchar();
        }
        cout<<x<<" "<<cnt<<endl;
    }
    return 0;
}

因为有scanf("%c")注意getchar的使用

题目中n(人数)与x(冰淇淋数)看似不会超int,但都取边界的时候(1000个人,每人都添加10的9次方个冰淇淋)便超int