Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Noic - Iniciante - Semana 50 - Problema 1
- // O(n)
- #include <bits/stdc++.h>
- using namespace std;
- const int maxn = 110;
- int l[maxn], r[maxn];
- int main(void)
- {
- int n, k;
- cin >> n;
- for (int i = 1; i <= n; i++)
- cin >> l[i] >> r[i];
- cin >> k;
- int ind; // capítulo que contém k
- for (int i = 1; i <= n; i++)
- if (l[i] <= k && k <= r[i])
- ind = i;
- cout << n-ind+1 << "\n";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement