#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct Play{
int min, down, yard, locat;
string Description, offname, defname;
double relevance;
};
bool customCompare(const Play &x, const Play &y)
{
return (x.relevance < y.relevance);
}
void printResults()
{
vector<Play> vecData;
Play p1;
Play p2;
vecData.push_back(p1);
vecData.push_back(p2);
sort(vecData.begin(),vecData.end(), [](const Play &x, const Play &y){ return (x.relevance < y.relevance);});
}
int main() {
// your code goes here
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKc3RydWN0IFBsYXl7CiAgICAgIGludCBtaW4sIGRvd24sIHlhcmQsIGxvY2F0OwogICAgICBzdHJpbmcgRGVzY3JpcHRpb24sIG9mZm5hbWUsIGRlZm5hbWU7CiAgICAgIGRvdWJsZSByZWxldmFuY2U7CiAgICAgfTsKCiAgICAgYm9vbCBjdXN0b21Db21wYXJlKGNvbnN0IFBsYXkgJngsIGNvbnN0IFBsYXkgJnkpCiAgICB7CiAgICAgICAgcmV0dXJuICh4LnJlbGV2YW5jZSA8IHkucmVsZXZhbmNlKTsKICAgIH0KCiAgICB2b2lkIHByaW50UmVzdWx0cygpCiAgICB7CiAgICAJdmVjdG9yPFBsYXk+IHZlY0RhdGE7CiAgICAJUGxheSBwMTsKICAgIAlQbGF5IHAyOwogICAgCXZlY0RhdGEucHVzaF9iYWNrKHAxKTsKICAgIAl2ZWNEYXRhLnB1c2hfYmFjayhwMik7CiAgICAgICAgc29ydCh2ZWNEYXRhLmJlZ2luKCksdmVjRGF0YS5lbmQoKSwgW10oY29uc3QgUGxheSAmeCwgY29uc3QgUGxheSAmeSl7IHJldHVybiAoeC5yZWxldmFuY2UgPCB5LnJlbGV2YW5jZSk7fSk7CiAgICB9CmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJcmV0dXJuIDA7Cn0=