Submission #382482

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
382482	2021-03-27 12:22:12	OptxPrime	Knjige (COCI20_knjige)	C++11	0 / 50	28 ms	492 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
using namespace std;
vector<int> lijeva, desna, sortirane; /// vektor 'lijeva' cuva pocetno stanje lijeve police
int main()
{
    int n;
    cin>>n;
    lijeva.resize(n);/// postavi velicinu vektora na n
    sortirane.resize(n);
    for(int i=0;i<n;i++){
        cin>>lijeva[i];
        sortirane[i] = lijeva[i];
    }
    sort( sortirane.begin(), sortirane.end() );
    reverse( lijeva.begin(), lijeva.end() ); /// obrnemo pocetni niz knjiga
    /*for( int i=0;i<sortirane.size();i++ ){
        cout << sortirane[i] << " ";
    }
    cout<<endl;*/
   // sort( d.begin(), d.end() ); - ovako se sortira vektor od najmanjeg do najveceg elementa
   // sort( d, d+n ); - ovako se sortira NIZ od najmanjeg do najveceg elementa
    for( int pozicija = 0; pozicija < n;pozicija++ ){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 50