Pagini recente » Cod sursa (job #888470) | Cod sursa (job #3275847) | Cod sursa (job #2040783) | Cod sursa (job #3275853) | Cod sursa (job #3338674)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("stergeri.in");
ofstream fout("stergeri.out");
int n,m,k;
vector<pair<int, int>> v;
void read()
{
fin >> n >> m >> k;
for(int i = 0; i < m; ++i){
int a,b;
fin >> a >> b;
v.push_back(make_pair(a,b));
}
}
void runAlgorithm()
{
for(int i = m - 1; i >= 0; --i){
if(k >= v[i].first){
k += v[i].second - v[i].first + 1;
}
}
fout << k;
}
int main()
{
read();
runAlgorithm();
return 0;
}