Cod sursa(job #3275907)
Utilizator | Data | 11 februarie 2025 21:51:29 | |
---|---|---|---|
Problema | Stergeri | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int n, q, k, x, y;
ifstream fin("stergeri.in");
ofstream fout("stergeri.out");
pair<int, int> M[100001];
int main()
{
fin >> n >> q >> k;
for(int i = 1; i <= q; ++i)
fin >> M[i].first >> M[i].second;
for(int i = q; i >= 1; --i)
{
if(k > M[i].first)
k += M[i].second - M[i].first + 1;
}
fout << k;
}