Pagini recente » Istoria paginii preoni-2007/clasament/runda-finala/9 | Arbori de intervale si aplicatii in geometria computationala | Istoria paginii preoni-2007/runda-2/11-12 | Istoria paginii preoni-2007/clasament/runda-finala/9 | Cod sursa (job #1170016)
#include <iostream>
using namespace std;
int v[100010], w[100010];
int main()
{
freopen("stergeri.in","r",stdin);
freopen("stergeri.out","w",stdout);
int N, M, K;
cin >> N >> M >> K;
for (int i = 1; i <= M; ++i)
cin >> v[i] >> w[i];
for (int i = M; i >= 1; --i)
if (v[i] <= K)
K += (w[i] - v[i] + 1);
cout << K << "\n";
return 0;
}