Submission #1146946

#TimeUsernameProblemLanguageResultExecution timeMemory
1146946bagelJust Long Neckties (JOI20_ho_t1)C++20
9 / 100
1094 ms4428 KiB
#include <bits/stdc++.h> using namespace std; int main() { //reverse sort arrays? int n; cin>>n; vector<int> a(n+1); vector<int> b(n); for (int i = 0; i < n+1; i++) { cin>>a[i]; } for (int i = 0; i < n; i++) { cin>>b[i]; } sort(b.begin(),b.end()); vector<int> c; for (int removal = 0; removal < n+1; removal++) { vector<int> test = a; test.erase(test.begin()+removal); sort(test.begin(),test.end()); int count = 0; vector<int> diff; for (int i = 0; i < test.size(); i++) { diff.push_back(max(0,test[i]-b[i])); } sort(diff.begin(),diff.end(),greater<>()); count = diff[0]; c.push_back(count); } for (int i = 0; i <c.size(); i++) { cout<<c[i]; if (i < c.size()-1) { cout<<' '; } } cout<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...