Cod sursa(job #1297651)
Utilizator | Data | 22 decembrie 2014 11:10:46 | |
---|---|---|---|
Problema | Restante | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin("stergeri.in");
ofstream fout("stergeri.out");
int n, m,k,i,d;
pair<int, int> p[100001];
int main(){
fin>>n>>m>>k;
for(i=1;i<=m;i++){
fin>>p[i].first>>p[i].second;
}
for(i=m;i>=1;i--){
if(k>=p[i].first){
d=p[i].second-p[i].first+1;
k+=d;
}
}
fout<<k;
return 0;
}