Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #define N 1000
- using namespace std;
- int main()
- {
- int n;
- ifstream f("sort.in");
- f>>n;
- int a[n],v1=0,v2=0,v3=0;
- for(int i=0;i<n;++i)
- {
- f>>a[i];
- switch(a[i])
- {
- case 1: ++v1;break;
- case 2: ++v2;break;
- case 3: ++v3;break;
- }
- }
- f.close();
- int v12=0,v13=0,v21=0,v23=0,v31=0,v32=0;
- for(int i=0;i<v1;++i)
- switch(a[i])
- {
- case 2: ++v12;break;
- case 3: ++v13;break;
- }
- for(int i=v1;i<v1+v2;++i)
- switch(a[i])
- {
- case 1: ++v21;break;
- case 3: ++v23;break;
- }
- for(int i=v1+v2;i<n;++i)
- switch(a[i])
- {
- case 1: ++v31;break;
- case 2: ++v32;break;
- }
- ofstream g("sort.out");
- g<<min(v21,v12)+min(v31,v13)+min(v23,v32)+2*(max(v12,v21)-min(v21,v12));
- g.close();
- return 0;
- }
Add Comment
Please, Sign In to add comment