c++ inläsning utläsning.

#include <iostream>
#include <string>
#include <map>
#include <algorithm>
#include <fstream>

using namespace std;

int value(char &sant)
{
	if(isalpha(sant))
	{
		return 0;
	}
	else
	{
		return 1;
	}
}


int main()
{
	const char*filename0="lgtg";
	const char*filename1="test";
	map<string, int> hash;
	map<int, string> sort;
	map<string, int>::iterator it0;
	map<int, string>::reverse_iterator it1;
	string word;
	int i;

	ifstream in(filename0);
	if(!in)
	{
		cout << "kunde inte öppna filen: " << filename0 << endl;
	}
	else
	{
		while(!in.eof())
		{
			in>>word;

			word.erase(remove_if(word.begin(), word.end(), value), word.end());
			transform(word.begin(), word.end(), word.begin(), ::tolower);
			hash[word]++;
			hash.erase("");	
		}
		in.close();
		ofstream out(filename1);
		for(it0 = hash.begin(); it0!=hash.end(); it0++)
		{
			word=(*it0).first;
			i=(*it0).second;
			sort[i]=word;
		}
		i=0;
		for(it1 = sort.rbegin(); it1 != sort.rend(); it1++)
		{
			if(i<10)
			{
				out << (*it1).second << " " << (*it1).first << endl;
			}
			i++;
		}
		out.close();
	}
}

the 2537
of 1258
a 1199
to 1185
and 1184
it 798
he 788
said 681
in 630
was 607

2538 the
1259 of
1199 a
1187 to
1184 and
892 it
808 he
681 said
632 you
630 in

#include <iostream> 
#include <string>
#include <map>
#include <algorithm>
#include <fstream>

using namespace std;

typedef pair<string, int> pair_t;
typedef map<string, int> map_t;
typedef map<string, int>::iterator it_t;


bool comp(pair_t a, pair_t b)
{
	return a.second<b.second; 
}

int value(char &sant)
{
	if(isalpha(sant))
	{
		return 0;
	}
	else
	{
		return 1;
	}
}


int main()
{
	const char*filename0="lgtg";
	const char*filename1="done";
	map_t hash;
	it_t it0;
	it_t it1;
	string word;
	int i, top;


	cout << "skriv in hur många av de mest återkommande ord du vill ska vissas(heltals värde): ";
	cin >> top;

	ifstream in(filename0);
	if(!in)
	{
		cout << "kunde inte öppna filen: " << filename0 << endl;
	}
	else
	{
		while(!in.eof())
		{
			in>>word;
			for(int j=0; j<word.size(); j++)
			{
				if(!isalpha(word.at(j)))
				{
					for(int y=word.size()-1; y>j; y--)
					{	
						in.putback(word.at(y));
						word.erase(y,1);
					}
				}	
			}	

			word.erase(remove_if(word.begin(), word.end(), value), word.end()); 
				    
			transform(word.begin(), word.end(), word.begin(), ::tolower);
			hash[word]++; 
			hash.erase("");
		
		}
		in.close();
		ofstream out(filename1);
		i=0;

		for(it0 = hash.begin(); it0!=hash.end(); it0++)
		{
			if(i<top)
			{
				it1 = max_element(hash.begin(), hash.end(), comp);
				out << (*it1).first << " " << (*it1).second << endl;
				hash.erase(it1);			}
			i++; 
		}





		out.close();
		cout << "Svaret hittar du i den ny skapta filen " << filename1 << " som ligger i denna map!" << endl; 
	}
}