#include<iostream>
#include<algorithm>
using namespace std;
struct question{
    double num=0;
    double energy=0;
    double per=0;
};
question a[1005]; 
//int partition(question a[],int left,int right);
//void qsort(question a[],int left,int right){
//    if(left<right){
//        int pos=partition(a,left,right);
//        qsort(a,left,pos-1);
//        qsort(a,pos+1,right);
//    }
//}
//int partition(question a[],int left,int right){
//    double pivit=a[left].per;
//    question que=a[left];
//    while(left<right){
//        while(left<right && a[right].per>pivit)  right--;
//        a[left]=a[right];
//        while(...