Pagini recente » Cod sursa (job #3177096) | Cod sursa (job #686777) | Cod sursa (job #255387) | Cod sursa (job #1149773) | Cod sursa (job #1779091)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("stergeri.in");
ofstream out("stergeri.out");
const int N = 2000000003;
const int M = 100003;
int n, m, k, x, y, st, dr, nr;
struct elem{
int s, d;
};
elem a[M];
int main()
{
int i;
in >> n >> m >> k;
for ( i = 1; i <= m; i++ )
in >> a[i].s >> a[i].d;
for ( i = m; i >= 1; i-- )
{
if ( k <= a[i].d && k >= a[i].s )
k+= a[i].d - a[i].s + 1;
else if ( k > a[i].d )
k+= a[i].d - a[i].s + 1;
}
out << k;
return 0;
}