QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#335671 | #6632. Minimize Median | mnzb2000 | WA | 107ms | 3648kb | C++23 | 916b | 2024-02-23 19:19:13 | 2024-02-23 19:19:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int t;
cin>>t;
while(t--){
int n,m,k,i,cnt,x,median=1e9+5;
cin>>n>>m>>k;
vector<int>a(n),cost(m);
for(int &x:a)cin>>x;
for(int &x:cost)cin>>x;
sort(a.begin(),a.end());
map<int,int>tmp,mp;
for(i=(n/2);i>=0;i--)mp[a[i]]++;
for(i=0;i<m;i++){
cnt=k/cost[i];
tmp=mp;
while(cnt--){
auto it=tmp.rbegin();
x=it->first;
tmp[x]--;
if(tmp[x]==0)tmp.erase(x);
tmp[(x/(i+1))]++;
}
auto it=tmp.rbegin();
x=it->first;
median=min(median,x);
}
cout<<median<<"\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3576kb
input:
3 3 5 0 2 5 2 3 2 4 6 13 3 5 3 2 5 3 3 2 4 6 13 3 5 6 2 5 2 3 2 4 6 13
output:
2 2 1
result:
ok 3 number(s): "2 2 1"
Test #2:
score: -100
Wrong Answer
time: 107ms
memory: 3648kb
input:
100000 5 10 5 3 7 1 10 10 11 6 11 6 1 8 9 1 3 1 5 6 51 2 2 2 5 1 42 61 26 59 100 54 5 10 76 7 5 8 4 7 97 4 44 83 61 45 24 88 44 44 5 8 90 1 1 5 1 3 35 15 53 97 71 83 26 7 5 3 52 1 1 3 1 1 22 6 93 5 6 28 6 6 1 3 1 9 31 2 19 10 27 5 8 31 3 6 2 1 2 32 29 13 7 57 34 9 5 5 6 75 3 3 4 5 4 40 56 38 60 17 3...
output:
0 2 0 0 0 0 0 0 3 4 0 0 0 0 1 1 0 0 0 0 1 1 0 2 2 0 0 0 0 0 2 0 0 0 2 2 0 1 0 0 0 0 1 0 2 4 1 1 0 0 2 0 0 7 0 1 0 0 0 1 1 0 1 0 1 0 0 2 1 0 6 3 0 0 1 0 2 0 0 3 0 1 0 1 0 2 0 0 0 0 1 2 1 4 0 0 0 0 0 0 1 2 2 1 2 2 0 1 1 0 0 0 0 0 1 2 1 4 1 0 4 1 2 1 0 0 0 0 1 2 1 0 1 2 3 1 0 1 1 1 0 1 5 0 1 2 0 2 0 1 ...
result:
wrong answer 133rd numbers differ - expected: '0', found: '1'