#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
struct Play{
      int min, down, yard, locat;
      string Description, offname, defname;
      double relevance;
     };
 
     static 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(), customCompare);
    }
int main() {
	// your code goes here
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKc3RydWN0IFBsYXl7CiAgICAgIGludCBtaW4sIGRvd24sIHlhcmQsIGxvY2F0OwogICAgICBzdHJpbmcgRGVzY3JpcHRpb24sIG9mZm5hbWUsIGRlZm5hbWU7CiAgICAgIGRvdWJsZSByZWxldmFuY2U7CiAgICAgfTsKCiAgICAgc3RhdGljIGJvb2wgY3VzdG9tQ29tcGFyZShjb25zdCBQbGF5ICZ4LCBjb25zdCBQbGF5ICZ5KQogICAgewogICAgICAgIHJldHVybiAoeC5yZWxldmFuY2UgPCB5LnJlbGV2YW5jZSk7CiAgICB9CgogICAgdm9pZCBwcmludFJlc3VsdHMoKQogICAgewogICAgCXZlY3RvcjxQbGF5PiB2ZWNEYXRhOwogICAgCVBsYXkgcDE7CiAgICAJUGxheSBwMjsKICAgIAl2ZWNEYXRhLnB1c2hfYmFjayhwMSk7CiAgICAJdmVjRGF0YS5wdXNoX2JhY2socDIpOwogICAgICAgIHNvcnQodmVjRGF0YS5iZWdpbigpLHZlY0RhdGEuZW5kKCksIGN1c3RvbUNvbXBhcmUpOwogICAgfQppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCXJldHVybiAwOwp9