Pagini recente » Cod sursa (job #1456093) | Cod sursa (job #17313) | Cod sursa (job #1256203) | Cod sursa (job #252858) | Cod sursa (job #1572146)
#include <stdio.h>
#define Nadejde 100000
typedef struct {
int l, r;
} pair;
int N, M, K;
pair stack[Nadejde];
int main(void) {
int i;
FILE *f = fopen("stergeri.in", "r");
/* Citirea datelor. */
fscanf(f, "%d %d %d", &N, &M, &K);
for (i = 0; i < M; i++) {
fscanf(f, "%d %d", &stack[i].l, &stack[i].r);
}
fclose(f);
/* Calcularea solutiei. */
for (i = M - 1; i >= 0; i--) {
if (stack[i].l <= K) {
K += stack[i].r - stack[i].l + 1;
}
}
/* Afisarea solutiei. */
freopen("stergeri.out", "w", stdout);
fprintf(stdout, "%d\n", K);
fclose(stdout);
/// Multumim Doamne!
puts("Doamne ajuta!");
return 0;
}