Pagini recente » Cod sursa (job #2098942) | Cod sursa (job #166886) | Cod sursa (job #2178420) | Cod sursa (job #2129207) | Cod sursa (job #1714274)
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn = 7000005;
char T[maxn];
long long s;
int n;
void rezolva()
{
gets(T);
gets(T);
int sz = strlen(T);
int nr = 0;
int last = 0;
for(int i = 0; i < sz; i++)
{
if(T[i] >= '0' && T[i] <= '9')
nr = nr * 10 + T[i] - '0';
else
{
if(nr - last > 0)
s = s + nr - last;
last = nr;
nr = 0;
}
}
if(nr - last > 0)
s = s + nr - last;
}
int main()
{
freopen("operatii.in", "r", stdin);
freopen("operatii.out", "w", stdout);
scanf("%d", &n);
rezolva();
printf("%lld", s);
return 0;
}