Pagini recente » Cod sursa (job #2752323) | Cod sursa (job #522279) | Cod sursa (job #3037806) | Cod sursa (job #16763) | Cod sursa (job #864498)
Cod sursa(job #864498)
#include<fstream>
#include<algorithm>
#include<vector>
#define Nmax 100005
#define d int
using namespace std;
ifstream f("stergeri.in");
ofstream g("stergeri.out");
d n,m,k,a,b;
d A[Nmax],B[Nmax];
void solve(int k)
{
int i,contor=0;
for(i=m;i;i--)
if(k>=A[i])
contor=contor+B[i]-A[i]+1;
k=k+contor;
g<<k;
}
int main()
{
f>>n>>m>>k;
int i;
for(i=1;i<=m;i++)
f>>A[i]>>B[i];
solve(k);
f.close();
g.close();
return 0;
}