1319 排队接水
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1005;
int n, ttl;
struct stud{
int t, id;
}a[N];
bool cmp(stud x, stud y) {
return x.t < y.t;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i ++) {
scanf("%d", &a[i].t);
a[i].id = i;
}
sort(a+1, a+1+n, cmp);
for (int i = 1; i <= n; i ++) {
printf("%d ", a[i]<