Cod sursa(job #2803294)
Utilizator | Grecu rares 0021592 | Data | 19 noiembrie 2021 19:15:49 |
---|---|---|---|
Problema | Carte2 | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva ICPC | Marime | 0.48 kb |
#include <iostream>
#include <algorithm>
using namespace std;
int t, v[4], v1[3], n, m;
int main()
{
cin >> t;
for (int i = 0; i < t; i++)
{
cin >> v1[0] >> v1[1];
for (int i = 0; i < 3; i++)
{
cin >> v[i];
}
sort(v1, v1 + 2, greater<int>());
sort(v, v + 3, greater<int>());
if (v[0] > v1[0] && v[1] > v1[1]) cout << "posibil";
else
cout << "imposibil";
}
return 0;
}