hihocoder1705 座位问题

思路：

使用堆模拟。复习了priority_queue自定义结构体比较函数的用法。

实现：

 #include <bits/stdc++.h>
 using namespace std;
 typedef pair<int, int> pii;
 int n, m, k;

 struct cmp
 {
     bool operator()(const pii & a, const pii & b)
     {
         if (a.first != b.first) return a.first < b.first;
         return a.second > b.second;
     }
 };
 int main()
 {
     cin >> n >> m >> k;
     priority_queue<pii, vector<pii>, cmp> q;
     vector<int> v;
     int x;
     for (int i = ; i < m; i++) { cin >> x; v.push_back(x); }
     v.push_back(); v.push_back(n + );
     sort(v.begin(), v.end());
     for (int i = ; i < v.size() - ; i++) q.push(pii(v[i + ] - v[i] - , v[i] + ));
     for (int i = ; i < k; i++)
     {
         pii tmp = q.top(); q.pop();
         int pos = tmp.second + (tmp.first - ) / ;
         cout << pos << endl;
         q.push(pii(pos - tmp.second, tmp.second));
         int r = tmp.second + tmp.first;
         q.push(pii(r - pos - , pos + ));
     }
     return ;
 }