2017暑假1

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.

#include <stdio.h>
int main (){
    int n, c = 0;
    long long x, m;
    scanf("%d%lld", &n, &m);
    while(n--){
        char s[5];  
        scanf("%s",s);
        if(s[0]=='+')  
        {  
            scanf("%I64d",&x);  
            m+=x;  
        }
        else {
            scanf("%I64d", &x);
            if(m-x >= 0){
                m-=x;
            }else c++;
        } 
    }
    printf("%I64d %d\n",m,c);
    return 0;
} 

Bear Limak likes watching sports on TV. He is going to watch a game today. The game lasts 90 minutes and there are no breaks.

Each minute can be either interesting or boring. If 15 consecutive minutes are boring then Limak immediately turns TV off.

You know that there will be n interesting minutes t1, t2, …, tn. Your task is to calculate for how many minutes Limak will watch the game.

Input
The first line of the input contains one integer n (1 ≤ n ≤ 90) — the number of interesting minutes.
The second line contains n integers t1, t2, …, tn (1 ≤ t1 < t2 < … tn ≤ 90), given in the increasing order.

Output
Print the number of minutes Limak will watch the game.

#include <stdio.h>
int main (){
    int n;
    scanf("%d",&n);
    int s = 15;
    while(n--){
        int x;
        scanf("%d", &x);
        if(x <= s){
            s = x+15;
        }else break;
    }
    if(s <=90){
        printf("%d\n", s);
    }else {
        printf("90\n");
    }

    return 0;
}