| Task: | Good grades |
| Sender: | aalto26iw_008 |
| Submission time: | 2026-11-04 17:46:45 +0200 |
| Language: | C++ (C++23) |
| Status: | COMPILE ERROR |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:15:69: error: 'INT64_MAX' was not declared in this scope
15 | std::vector<std::vector<std::pair<long long, int>>> groups(k, {{INT64_MAX, 0}});
| ^~~~~~~~~
input/code.cpp:4:1: note: 'INT64_MAX' is defined in header '<cstdint>'; did you forget to '#include <cstdint>'?
3 | #include <algorithm>
+++ |+#include <cstdint>
4 |
input/code.cpp:15:83: error: no matching function for call to 'std::vector<std::vector<std::pair<long long int, int> > >::vector(int&, <brace-enclosed initializer list>)'
15 | std::vector<std::vector<std::pair<long long, int>>> groups(k, {{INT64_MAX, 0}});
| ^
In file included from /usr/include/c++/13/vector:66,
from input/code.cpp:2:
/usr/include/c++/13/bits/stl_vector.h:707:9: note: candidate: 'template<class _In...Code
#include <iostream>
#include <vector>
#include <algorithm>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int k, n;
std::cin >> n >> k;
std::vector<std::pair<long long, int>> s(n);
for (int i = 0; i<n; i++) {
std::cin >> s[i].first;
s[i].second = i;
}
std::vector<std::vector<std::pair<long long, int>>> groups(k, {{INT64_MAX, 0}});
for (int i = 0; i<n; i++) {
for (int j = 0; j < k; j++) {
long long locmin = groups[j][0].first;
long long locw = groups[j][0].second;
long long tmp = std::min(locmin, s[i].first);
if (tmp * (locw + 1) > locmin * locw) {
if (s[i].first > tmp) continue;
groups[j].push_back(s[i]);
std::sort(groups[j].begin() + 1, groups[j].end(), [](const std::pair<long long, int>& a,
const std::pair<long long, int>& b) { return a.first <= b.first; });
groups[j][0].first = tmp;
groups[j][0].second++;
break;
}
}
}
std::sort(groups.begin(), groups.end(), [](const std::vector<std::pair<long long, int>>& a,
const std::vector<std::pair<long long, int>>& b) { return a[0].first <= b[0].first; });
for (int j = k - 1; j >= 0; j--) {
if (groups[j][0].second == 0) {
for (int l = 0; l < k; l++) {
if (groups[l][0].second > 2) {
groups[l][0].second--;
groups[j].push_back(groups[l].back());
groups[j][0] = {groups[j][1].first, 1};
groups[l].erase(groups[l].end() - 1);
break;
}
}
}
}
std::vector<int> toprint(n);
for (int i = 1; i <= k; i++) {
for (int j = 1; j < groups[i - 1].size(); j++) {
toprint[groups[i - 1][j].second] = i;
}
}
for (int t : toprint) {
std::cout << t << ' ';
}
std::cout << '\n';
}