This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 5;
int n, k;
pair<int, int> arr[N];
struct Item{
int k;
long long c;
bool operator < (const Item &sc) const{
if(k == sc.k) return c < sc.c;
else return k > sc.k;
}
};
vector<Item> v;
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> arr[i].second >> arr[i].first;
sort(arr + 1, arr + n + 1);
for(int i = 1; i <= n; i++){
int tmp = v.size();
for(int j = 0; j < tmp; j++){
if(v[j].k < arr[i].first) v.push_back({v[j].k + 1, v[j].c + arr[i].second});
}
v.push_back({1, arr[i].second});
sort(v.begin(), v.end());
while(v.size() > N * 2) v.pop_back();
}
for(int i = 0; i < min(k, (int)v.size()); i++) cout << v[i].k << " " << v[i].c << "\n";
for(int i = 0; i < k - (int)v.size(); i++) cout << 0 << " " << 0 << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |