Cod sursa(job #2326082)
Utilizator | Data | 23 ianuarie 2019 12:28:45 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | simulare_preoli | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
#define X 100001
using namespace std;
int main(){
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, a[X],max = 0, k = 0;
fin>>n;
for(int i = 1; i <= n; ++i){
fin>>a[i];
}
for(int i = 1; i <= n; ++i){
sort(a+1, a+n+1);
fout<<a[i]<<" ";
while(a[n]>a[n - 1]){
++k;
}
}
fout<<"\n";
fout<<k;
}