# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199854 | milagrosvilla1803 | Pod starim krovovima (COCI20_psk) | C++11 | 6 ms | 416 KiB |
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;
int n, vacios=0;
struct vasos{
long long int tamanio;
int indice;
};
vasos Vasos[1005];
long long int acumulado=0;
long long int aux;
bool ordenar(vasos a, vasos b){
if(a.tamanio>b.tamanio) return true;
return false;
}
long long int listos[1005];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n;
for(int i=0;i<n;i++){
cin>>aux;
acumulado+=aux;
cin>>Vasos[i].tamanio;
Vasos[i].indice=i;
}
sort(Vasos,Vasos+n,ordenar);
for(int i=0;i<n;i++){
if(acumulado==0) vacios++;
if(acumulado>=Vasos[i].tamanio){
listos[Vasos[i].indice]=Vasos[i].tamanio;
acumulado-=Vasos[i].tamanio;
}else{
listos[Vasos[i].indice]=acumulado;
acumulado=0;
}
}
cout<<vacios<<"\n";
for(int i=0;i<n;i++){
cout<<listos[i]<<" ";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |