eolymp
bolt
Try our new interface for solving problems
Problems

Sorting

published at 4/16/22, 4:49:01 pm

Слово "Возрастания" не существуют...

published at 3/12/24, 2:00:13 pm

include <iostream>

include <algorithm>

using namespace std; class Massiv{ public: int n; void massivInfo();

}; void Massiv::massivInfo(){ cin>>n; int x[n]; for(int i=0;i<n;i++){ cin>>x[i]; } sort(x,x+n); for(int i=0;i<n;i++){ cout<<x[i]<<" "; } } int main(){ Massiv m; m.massivInfo(); }

published at 4/11/24, 8:35:31 am

include <iostream>

include <vector>

include <algorithm>

using namespace std;

int main() { vector<int> v; int i,n; scanf("%d",&n); v.resize(n); for(i=0;i<n;i++) scanf("%d",&v[i]); sort(v.begin(),v.end()); for(i=0,i<n;i++) printf("%d",v[i]); printf("\n");

return 0;

}