Submission #818012

#TimeUsernameProblemLanguageResultExecution timeMemory
818012LiudasHiring (IOI09_hiring)C++17
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> #define endl "\n" using namespace std; struct node{ double Q; double P; double U; int id; }; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long N, W; double H = 0, BP = 0; cin >> N >> W; vector<node> arr(N); for(int i = 0; i < N; i ++){ cin >> arr[i].P >> arr[i].Q; arr[i].U = arr[i].P/arr[i].Q; arr[i].id = i + 1; } sort(arr.begin(), arr.end(), [&](node a, node b){return a.U < b.U;}); priority_queue<pair<double, int>> que; double qual = 0, id = 0; for(int i = 0; i < N; i ++){ qual += arr[i].Q; que.push({arr[i].Q, arr[i].id}); while(qual * arr[i].U > W){ qual -= que.top().first; que.pop(); } if(que.size() > H){ H = que.size(); BP = qual * arr[i].U; id = i + 1; } else if(que.size() == H && BP > qual * arr[i].U){ BP = qual * arr[i].U; id = i + 1; } } while(!que.empty())que.pop(); qual = 0; set<int> in; for(int i = 0; i < id; i ++){ qual += arr[i].Q; que.push({arr[i].Q, arr[i].id}); in.insert(arr[i].id]); while(qual * arr[i].U > W){ qual -= que.top().first; in.erase(que.top().second]); que.pop(); } } cout << H << endl; for(int i : in){ cout << i << endl; } return 0; }

Compilation message (stderr)

hiring.cpp: In function 'int main()':
hiring.cpp:50:28: error: expected ')' before ']' token
   50 |         in.insert(arr[i].id]);
      |                  ~         ^
      |                            )
hiring.cpp:53:38: error: expected ')' before ']' token
   53 |             in.erase(que.top().second]);
      |                     ~                ^
      |                                      )