blob: 092dc3d92daae4f44d8be54e80caadc4b9ecfb78 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
#include <iostream>
#include <vector>
#include <algorithm>
int cabe(std::vector<int> j, std::vector<int> c) {
for (int i = 0; i < 3; i++) {
if (j[i] >= c[i]) {
return 0;
}
}
return 1;
}
int main() {
int casos;
std::vector<int> juguete;
std::vector<int> caja;
int n;
std::string salida;
std::cin >> casos;
for (int i = 0; i < casos; i++) {
juguete.clear();
caja.clear();
for (int j = 0; j < 3; j++) {
std::cin >> n;
juguete.push_back(n);
}
for (int j = 0; j < 3; j++) {
std::cin >> n;
caja.push_back(n);
}
std::sort(juguete.begin(), juguete.end());
std::sort(caja.begin(), caja.end());
salida = cabe(juguete, caja) ? "SIRVE" : "NO SIRVE";
std::cout << salida << std::endl;
}
}
|
