Can someone please help me figure out, what i did wrong in kickstart round f problem A

Here is a link to the problem.

My Source Code:

```
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<math.h>
#include<sstream>
#include<string.h>
using namespace std;
#define MOD 1000000007
#define endl "\n"
#define lli long long int
bool func(pair<int,int> a,pair<int,int> b){
return a.first<b.first;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int T;
cin>>T;
for(int q=1;q<=T;q++){
int n,x;
cin>>n>>x;
vector<pair<int,int>> pos;
for(int i=0;i<n;i++){
int temp;
cin>>temp;
pos.push_back(make_pair(ceil((double)temp/x),i+1));
}
sort(pos.begin(),pos.end(),func);
cout<<"Case #"<<q<<": ";
for(int i=0;i<n;i++){
cout<<pos[i].second<<" ";
}
cout<<endl;
}
return 0;
}
```