116A

116A

Program

#include <stdio.h>
 
int main()
{
 
    int counter_1, counter_2, no_of_inputs, passengers, max_passengers;
    passengers=max_passengers=0;
    scanf("%d", &no_of_inputs);
    for (counter_1 = 0; counter_1 < no_of_inputs; counter_1++)
    {
	int a, b;
	scanf("%d%d", &a, &b);
	passengers += b-a;
	int max_capacity;
	max_passengers = ((max_passengers > passengers)?max_passengers:passengers);
    }
    printf("%d\n",max_passengers);
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
 
int main()
{
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
 
    int counter_1, counter_2, no_of_inputs, passengers, max_passengers;
    passengers=max_passengers=0;
    cin >> no_of_inputs;
 
    for (counter_1 = 0; counter_1 < no_of_inputs; counter_1++)
    {
	int a, b;
	cin >> a >> b;
	passengers += b-a;
	int max_capacity;
	max_passengers = ((max_passengers > passengers)?max_passengers:passengers);
    }
    cout << max_passengers << '\n';
 
    return 0;
}

n=int(input())
stops=[]
mxpassengers=[]
passengers=0
stops=[list(map(int,input().split(' ')))for _ in range(n)]
for x in stops: 
    passengers += x[1]-x[0]
    mxpassengers.append(passengers)
print(max(mxpassengers))

n = int(input())
passengers = 0
mx_passengers = 0
for _ in range(n):
    a,b = map(int, input().split(' '))
    passengers += b - a
    mx_passengers = max(mx_passengers, passengers)
print(mx_passengers)

Comments